OFFSET
1,2
MATHEMATICA
Select[ Range[ 10^6 ], Mod[ PowerMod[ 4, #, # ] + PowerMod[ 2, #, # ] + 1, # ] == 0 & ]
PROG
(PARI) isok(n) = Mod(4, n)^n + Mod(2, n)^n == -1 \\ Andrew Howroyd, Oct 30 2025
(Python)
from itertools import count, islice
def A057845_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda k: (a:=pow(2, k, k))*(a+1)%k == k-1, count(max(startvalue, 1)))
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Robert G. Wilson v, Nov 09 2000
EXTENSIONS
a(14) onward from Andrew Howroyd, Oct 30 2025
STATUS
approved
