login
A386913
Smallest k for which the number of divisors d of k such that d == -d^k (mod k) is equal to n, or -1 if no such k exists.
1
1, 2, 6, 42, 66, 1770, 2926, 8646, 178486, 90706, 639730, 17646706, 5533066, 35193246, 13775230, 144313246
OFFSET
0,2
PROG
(Magma) [Min([k: k in [1..2*10^5] | 1 + #[d: d in Divisors(k) | -Modexp(d, k, k) mod k eq d] eq n]): n in [1..10]];
CROSSREFS
KEYWORD
nonn,more
AUTHOR
STATUS
approved