OFFSET
1,1
COMMENTS
a(25) > 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={1, 6, 6}; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
Flatten[Position[LinearRecurrence[{1, 1, 1}, {1, 6, 6}, 2100], _?(PrimeQ[#]&)]]-1 (* The program generates the first 17 terms of the sequence. *) (* Harvey P. Dale, Dec 14 2025 *)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Robert Price, May 17 2014
STATUS
approved
