OFFSET
1,1
COMMENTS
a(40) > 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, 9, 9}; 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, 9, 9}, 200000], _?PrimeQ]]-1 (* The prime number at index 195346 (term a(39) of this sequence) has 51699 digits, so this program takes a long time to run. *) (* Harvey P. Dale, Dec 29 2019 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Price, Jul 08 2014
STATUS
approved
