OFFSET
1,1
COMMENTS
LINKS
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.
MATHEMATICA
t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^5-x^4-x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 5000}]; Prime[Flatten[Position[t, 5]]]
PROG
(Python)
from itertools import islice
from sympy import Poly, nextprime
from sympy.abc import x
def A106281_gen(): # generator of terms
p = 2
while True:
if len(Poly(x*(x*(x*(x*(x-1)-1)-1)-1)-1, x, modulus=p).ground_roots())==5:
yield p
p = nextprime(p)
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, May 02 2005
STATUS
approved