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”).

A255536
Indices of primes in the 9th-order Fibonacci number sequence, A251752.
1
10, 11, 21, 29, 301, 57089
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, 1, 0, 0, 0, 0, 0, 0, 0}; step=9; lst={}; For[n=step, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst, n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
KEYWORD
nonn,more
AUTHOR
Robert Price, Feb 24 2015
STATUS
approved