OFFSET
1,2
MATHEMATICA
Select[ Range[ 10^6 ], Mod[ PowerMod[ 8, #, # ] + PowerMod[ 6, #, # ] + PowerMod[ 4, #, # ] + PowerMod[ 2, #, # ] + 1, # ] == 0 & ]
PROG
(PARI) is(k)=sum(i=1, 4, Mod(2*i, k)^k)==-1; \\ Jinyuan Wang, Jun 18 2026
(Python)
from itertools import count, islice
def A057840_gen(startvalue=1): # generator of terms >= startvalue
for k in count(max(startvalue, 1)):
a, b = pow(2, k, k), pow(3, k, k)
c = ((a+1)*a+b+1)%k
c = c*a%k
if c == k-1:
yield k
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Robert G. Wilson v, Nov 09 2000
EXTENSIONS
a(36)-a(41) from Jinyuan Wang, Jun 18 2026
STATUS
approved
