OFFSET
1,1
COMMENTS
a(45) > 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={1, 1, 1, 1, 1, 1, 1, 1, 1, 1}; step=10; lst={}; For[n=step+1, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst, n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
Position[With[{c=Table[1, {10}]}, LinearRecurrence[c, c, 1000]], _?PrimeQ]//Flatten (* The program generates the first 27 terms of the sequence. *) (* Harvey P. Dale, Nov 11 2024 *)
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Robert Price, Apr 15 2015
STATUS
approved