OFFSET
1,1
COMMENTS
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000
PROG
(Python)
from itertools import count, islice
from sympy import isprime, primefactors, factorint, integer_log
def A371900_gen(startvalue=2): # generator of terms >= startvalue
for n in count(max(startvalue, 2)):
if not isprime(n+1):
q = min(primefactors(n+1))
for m in range(4, q**2):
f = factorint(m)
if sum(f.values()) > 1:
c = 0
for p in sorted(f):
a = pow(n, integer_log(p, n)[0]+1, m)
for _ in range(f[p]):
c = (c*a+p)%m
if not c:
yield n
break
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Chai Wah Wu, Apr 11 2024
STATUS
approved