login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A169694
Numbers of the form Fibonacci(i) + Fibonacci(j), where i and j have opposite parity and |i-j| > 1.
1
2, 4, 5, 6, 9, 10, 13, 14, 16, 22, 23, 26, 34, 35, 37, 42, 56, 57, 60, 68, 89, 90, 92, 97, 110, 145, 146, 149, 157, 178, 233, 234, 236, 241, 254, 288, 378, 379, 382, 390, 411, 466, 610, 611, 613, 618, 631, 665, 754, 988, 989, 992, 1000, 1021, 1076, 1220, 1597, 1598, 1600
OFFSET
1,1
COMMENTS
By Zeckendorf's theorem, a number has at most one representation in this form (cf. A035517).
EXAMPLE
5 = Fibonacci(0)+Fibonacci(5).
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 14 2010
STATUS
approved