The period of these numbers modulo m is equal to m if and only if 24 times 5 to the lambda where lambda is an integer greater than or equal to zero. Cassini's Identity is on these numbers. The Euclidean Algorithm's worst case occurs when finding the greatest common denominator of two of these numbers according to Lame's Theorem.  The closed form solution is called Binet's 
The period of these numbers modulo m is equal to m if and only if 24 times 5 to the lambda where lambda is an integer greater than or equal to zero. Cassini's Identity is on these numbers. The Euclidean Algorithm's worst case occurs when finding the greatest common denominator of two of these numbers according to Lame's Theorem.  The closed form solution is called Binet's formula, and as n goes to infinity, the nth one of these numbers divided by the previous one approaches the golden ratio. They were used by their namesake to solve a problem about the population of breeding rabbits. For 10 points, name this sequence of numbers that start with 1, 1, 2, 3, and 5.
The period of these numbers modulo m is equal to m if and only if 24 times 5 to the lambda where lambda is an integer greater than or equal to zero.
Fibonacci numbers [or Fibonacci sequence]