OFFSET
1,2
COMMENTS
Conjecture: For k > 2, k^(m + 1) == -1 (mod m) has an infinite number of positive solutions.
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..1528 (n = 1..100 from Robert Israel)
MAPLE
filter:= m -> 3 &^ (m+1) + 1 mod m = 0:
select(filter, [$1..10^7]); # Robert Israel, Oct 30 2019
PROG
(Magma) [n+1: n in [0..5000000] | Modexp(3, n+2, n+1) eq n];
(PARI) isok(m) = Mod(3, m)^(m+1) == -1; \\ Michel Marcus, Oct 10 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Oct 08 2019
STATUS
approved