OFFSET
1,1
COMMENTS
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
MAPLE
Res:= NULL: count:= 0: p:= 0:
P:= x^4 - x^3 - x^2 - x - 1:
while count < 100 do
p:= nextprime(p);
if [msolve(P, p)] = [] then
Res:= Res, p; count:= count+1;
fi
od:
Res; # Robert Israel, Mar 13 2024
MATHEMATICA
t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^4-x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 200}]; Prime[Flatten[Position[t, 0]]]
PROG
(Python)
from itertools import islice
from sympy import Poly, nextprime
from sympy.abc import x
def A106283_gen(): # generator of terms
p = 2
while True:
if len(Poly(x*(x*(x*(x-1)-1)-1)-1, x, modulus=p).ground_roots())==0:
yield p
p = nextprime(p)
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, May 02 2005
EXTENSIONS
Name corrected by Robert Israel, Mar 13 2024
STATUS
approved