editing
approved
editing
approved
Select[ModuleWith[{nn=8, lr}, lr=PadRight[{}, nn, 8, 1]; }, LinearRecurrence[lr, lr, 200]], PrimeQ] (* Harvey P. Dale, Dec 03 2022 *)
approved
editing
editing
approved
Select[Module[{nn=8, lr}, lr=PadRight[{}, nn, 1]; LinearRecurrence[lr, lr, 200]], PrimeQ] (* Harvey P. Dale, Dec 03 2022 *)
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
2, 509, 128257, 133294824621464999938178340471931877, 459685204950086135105267245512185974401023293995416925926463802340963167265834025308328431781824206241329, 113, 449, 226241, 14307889, 113783041, 1820091580429249, 233322881089059894782836851617, 29566627412209231076314948970028097, 59243719929958343565697204780596496129, 7507351981539044730893385057192143660843521
a={0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1}; step=8; lst={}; For[n=step, +1, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst, sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst
(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(p=polcoeff(gf+O(x^(n+1)), n)), print1(p, ", ")); ); } \\ Michel Marcus, Jan 12 2015
allocated for Robert PricePrimes in the 8th-order Fibonacci numbers A079262.
2, 509, 128257, 133294824621464999938178340471931877, 4596852049500861351052672455121859744010232939954169259264638023409631672658340253083284317818242062413
1,1
a(6) is too large to display here. It has 395 digits and is the 1322nd term in A079262.
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, sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst
(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(p=polcoeff(gf+O(x^(n+1)), n)), print1(p, ", ")); ); } \\ Michel Marcus, Jan 12 2015
allocated
nonn
Robert Price, Jan 30 2015
approved
editing
allocated for Robert Price
allocated
approved