OFFSET
1,2
REFERENCES
J. Earls, "Fibonacci Prime Decompositions," Mathematical Bliss, Pleroma Publications, 2009, pages 76-79. ASIN: B002ACVZ6O [From Jason Earls, Nov 24 2009]
LINKS
T. D. Noe, Table of n, a(n) for n=1..10000
Lenny Jones, Fibonacci variations of a conjecture of Polignac, Integers, 12 (2012), A11.
EXAMPLE
The smallest prime number is 2, the smallest Fibonacci number is 0; hence 1 can't be presented as a sum of a prime number and a Fibonacci number.
MATHEMATICA
nn = 17; f = Union[Fibonacci[Range[0, nn]]]; p = Prime[Range[PrimePi[f[[-1]]]]]; fp = Select[Union[Flatten[Outer[Plus, f, p]]], # < f[[-1]] &]; Complement[Range[f[[-1]] - 1], fp] (* T. D. Noe, Mar 06 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Tanya Khovanova, Aug 12 2007
STATUS
approved