OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
Numbers k such that the coefficient of x^k in the product (Sum_{i>=0} x^Fibonacci(i)) * (Sum_{j>=0} x^(Fibonacci(j)^2)) is 0.
EXAMPLE
16 is a term since there does not exist any pair of integers i,j >= 0 such that Fibonacci(i) + Fibonacci(j)^2 = 16.
MAPLE
N:= 1000: # for terms <= N
r:= ceil(log[(1+sqrt(5))/2](sqrt(5)*N)):
Fibs:= select(`<=`, [seq(combinat:-fibonacci(i), i=0..r)], N):
Fibsq:= select(`<=`, map(t -> t^2, Fibs), N):
S:= select(`<=`, {seq(seq(a+b, a=Fibs), b=Fibsq)}, N):
sort(convert({$0 .. N} minus S, list)); # Robert Israel, Jun 11 2026
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Angad Singh, Jul 09 2022
STATUS
approved
