OFFSET
1,1
COMMENTS
Numbers k such that k = A000032(x) + y^2 for x, y >= 0 has at least 3 solutions.
Conjecture: there are never more than 3 solutions.
EXAMPLE
MAPLE
N:= 3*10^8: # for terms <= N
luc:= n -> combinat:-fibonacci(n-1) + combinat:-fibonacci(n+1):
S:= {}:
for x from 1 to floor(sqrt(N)) do
s:= x^2;
for i from 2 do
l:= luc(i);
if s+l > N then break fi;
v:= f(s+l);
if v >= 3 and not member(s+l, S) then S:= S union {s+l}; fi
od od:
sort(convert(S, list));
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Apr 23 2023
STATUS
approved
