OFFSET
1,2
COMMENTS
0 is considered to be a Fibonacci number.
MAPLE
q:= proc(n) local f, g; f, g:= 0, 1;
do if f>=n then return true
elif issqr(n-f) then return false
else f, g:= g, f+g
fi od
end:
select(q, [$0..200])[]; # Alois P. Heinz, May 22 2021
MATHEMATICA
nn = 156; sq = Range[Sqrt[nn]]^2; fb = {}; i = 0; While[f = Fibonacci[i]; f < nn, i++; AppendTo[fb, f]]; fb = Union[fb]; Complement[Range[0, nn], Union[Flatten[Outer[Plus, sq, fb]]]] (* T. D. Noe, Jul 31 2012 *)
PROG
(Python)
prpr = 0
prev = 1
fib = [0]*100
for n in range(100):
fib[n] = prpr
curr = prpr+prev
prpr = prev
prev = curr
#print fib[n]
for n in range(777):
i = 1
yes = 0
while i*i<=n:
r = n - i*i
if r in fib:
yes = 1
break
i += 1
if yes==0:
print n,
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Alex Ratushnyak, Jul 16 2012
STATUS
approved