login
A255529
Indices of primes in the 9th-order Fibonacci number sequence, A104144.
1
OFFSET
1,1
COMMENTS
a(4) > 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, 1}; 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
PROG
(PARI) a104144(n) = polcoeff(x^8/(1-x-x^2-x^3-x^4-x^5-x^6-x^7-x^8-x^9) + O(x^(n+1)), n);
lista(nn) = {for (n=1, nn, if (isprime(a104144(n)), print1(n, ", ")); ); } \\ Michel Marcus, Feb 27 2015
KEYWORD
nonn,more
AUTHOR
Robert Price, Feb 24 2015
STATUS
approved