OFFSET
1,1
COMMENTS
Numbers k such that k - A000045(i) is prime for exactly one i >= 0.
1 = Fibonacci(1) = Fibonacci(2), so cases where the Fibonacci number is 1 are counted as two ways. Also, if Fibonacci(i) and Fibonacci(j) are both primes (with i <> j), Fibonacci(i) + Fibonacci(j) and Fibonacci(j) + Fibonacci(i) are counted as two ways.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(5) = 29 is a term because 29 - Fibonacci(i) is prime only for i = 0.
MAPLE
filter:= proc(n) local f, i, d, state;
state:= 0;
for i from 0 do
if i = 2 then next fi;
f:= combinat:-fibonacci(i);
if f >= n then return (state = 1) fi;
if isprime(n-f) then
state:= state+1;
if state = 2 then return false fi;
fi
od;
end proc:
select(filter, [$1..1000]);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Aug 22 2024
STATUS
approved