login
A049050
Least p with exactly n distinct factorial numbers == 1 (mod p).
1
2, 5, 29, 17, 23, 199, 619, 3313, 4093, 3011, 355799, 52163, 12087071, 3408707, 26927543
OFFSET
1,1
PROG
(PARI) f(n) = my(p = prime(n)); sum(k = 1, p-1, k! % p == 1); \\ A049047
a(n) = my(k=1); while (f(k) != n, k++); prime(k); \\ Michel Marcus, Jun 08 2026
CROSSREFS
KEYWORD
nonn,more,changed
EXTENSIONS
a(13)-a(15) from Giovanni Resta, Jun 28 2019
STATUS
approved