OFFSET
1,2
COMMENTS
See A005652 for the case where the sum of two terms is never a Fibonacci number.
LINKS
Matthew Conroy, Table of n, a(n) for n = 1..10000
MATHEMATICA
t = {1}; Do[k = t[[-1]] + 1; While[Length[Select[t, ! IntegerQ[Sqrt[# + k]] &]] < Length[t], k++]; AppendTo[t, k], {n, 2, 100}]; t (* T. D. Noe, Jan 10 2012 *)
PROG
(PARI) seq(n)={my(a=vector(n)); a[1]=1; for(n=2, n, my(m=a[n-1], f=1); while(f, m++; f=0; for(k=1, n-1, f=issquare(a[k]+m); if(f, break))); a[n]=m); a} \\ Andrew Howroyd, Sep 19 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
John W. Layman, Jan 09 2012
STATUS
approved