OFFSET
1,1
COMMENTS
LINKS
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
FORMULA
a(n) = A105758 (n) + 4.
MATHEMATICA
a = {0, 0, 0, 0, 0, 1}; For[n = 6, n ≤ 1000, n++, sum = Plus @@ a;
If[PrimeQ[sum], Print[n]]; a = RotateLeft[a]; a[[6]] = sum]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Robert Price, Nov 02 2014
STATUS
approved