OFFSET
1,1
PROG
(PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^9)^(p-1)==1, return(b)))
(Python)
from sympy import prime
from sympy.ntheory.residue_ntheory import nthroot_mod
def A353942(n): return 2**9+1 if n == 1 else int(nthroot_mod(1, (p:= prime(n))-1, p**9, True)[1]) # Chai Wah Wu, May 17 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Felix Fröhlich, May 12 2022
EXTENSIONS
a(5)-a(6) from Amiram Eldar, May 12 2022
More terms from Jinyuan Wang, May 17 2022
STATUS
approved