login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253705 Indices of primes in the 8th-order Fibonacci number sequence, A079262. 3
9, 17, 25, 125, 350, 1322, 108935, 199528 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(9) > 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, 1}; step=8; 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}, {0, 0, 0, 0, 0, 0, 0, 1}, 200000], _?PrimeQ]]-1 (* The program takes a long time to run *) (* Harvey P. Dale, Apr 26 2018 *)
PROG
(PARI) lista(nn) = {gf = x^7/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8); for (n=0, nn, if (isprime(polcoeff(gf+O(x^(n+1)), n)), print1(n, ", ")); ); } \\ Michel Marcus, Jan 12 2015
CROSSREFS
Sequence in context: A211422 A035198 A271186 * A056233 A260264 A126623
KEYWORD
nonn,more
AUTHOR
Robert Price, Jan 09 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 17:39 EDT 2024. Contains 371797 sequences. (Running on oeis4.)