OFFSET
1,1
COMMENTS
a(7) > 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.
OEIS Wiki, Index to OEIS Section Fi
MATHEMATICA
a={0, 0, 0, 0, 0, 0, 0, 0, 0, 1}; step=10; lst={}; For[n=step, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst, n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
Flatten[Position[LinearRecurrence[{1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, 69000], _?PrimeQ]]-1 (* Harvey P. Dale, Dec 08 2017 *)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Robert Price, Apr 18 2015
STATUS
approved