OFFSET
1,1
PROG
(PARI) for(n=1, 10, b=2; while(b > 0, i=0; forcomposite(c=2, b, if(Mod(b, c^2)^(c-1)==1, i++)); if(i==n, print1(b, ", "); break({1})); b++))
(Python)
from itertools import count
from sympy import isprime
def A255885(n):
for b in count(1):
if n == sum(1 for c in range(2, b+1) if not isprime(c) and pow(b, c-1, c**2) == 1):
return b # Chai Wah Wu, May 18 2022
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Felix Fröhlich, Mar 09 2015
EXTENSIONS
a(20) from Chai Wah Wu, May 18 2022
a(21)-a(24) from Chai Wah Wu, May 19 2022
STATUS
approved