OFFSET
1,2
COMMENTS
Except for the initial 1, each term can be expressed as the sum of a Fibonacci number and a non-Fibonacci number (A001690) and is thus the sum of three or more Fibonacci numbers. - Alonso del Arte, Jun 18 2013
That is, aside from the first term, numbers n such that A007895(n) > 2. - Charles R Greathouse IV, Jun 18 2013
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
Complement[ Range[ Fibonacci[ 12 ]], Union[ Flatten[ Table[ Fibonacci[i] + Fibonacci[j], {i, 12}, {j, i - 1}]]]] (* Robert G. Wilson v, Jul 22 2005 *)
PROG
(PARI) is(n)=if(n<9, return(n==1)); my(k); while(fibonacci(k++)<=n, ); n-=fibonacci(k-1); k=n^2; k+=(k+1)<<2; !issquare(k) && !issquare(k-8) \\ Charles R Greathouse IV, Jun 18 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Avi Peretz (njk(AT)netvision.net.il), Jan 29 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Jan 31 2001
STATUS
approved