OFFSET
1,2
COMMENTS
a(47) > 2*10^5.
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
MATHEMATICA
a={3, 1, 1}; Print[0]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Price, Jan 16 2014
EXTENSIONS
Name clarified by Arthur O'Dwyer, Jul 25 2024
STATUS
approved