login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A257227
Indices of primes in the 10th-order Fibonacci number sequence, A122265.
2
11, 361, 373, 2440, 14002, 68990
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.
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
Sequence in context: A303116 A162019 A066268 * A176474 A000464 A291973
KEYWORD
nonn,more
AUTHOR
Robert Price, Apr 18 2015
STATUS
approved