For 10 points, name these numbers equal to the sum of the two previous ones, beginning 1, 1, 2, 3, 5, 8, 13, 21, 34, etc.
Zeckendorf representation describes integers as the sum of these, and they can be found by Binet's formula. "z over the quantity 1 minus z minus z squared" is their generating function, and they are a case of the Lucas sequence. Euclid's algorithm is slowest for these since their ratio is given by a continued fraction with all 1's, which converges to the golden ratio at infinity. They give the number of ways to tile a 2 by n strip and model reproducing rabbits. For 10 points, name these numbers equal to the sum of the two previous ones, beginning 1, 1, 2, 3, 5, 8, 13, 21, 34, etc.
Zeckendorf representation describes integers as the sum of these, and they can be found by Binet's formula. "
{Fibonacci} numbers or sequence