|
|
A329168
|
|
Numbers m that divide 4^(m + 1) + 1.
|
|
2
|
|
|
1, 17, 4097, 7361, 85073, 658529, 3999137, 72281281, 285143057, 628944689, 854112113, 1423081169, 2561019281, 3111576929, 4298117633, 5921265041, 14224884929, 21336998129, 34317377233, 50723421713, 63797137889, 144269032049, 163834314353, 187397322209, 212565453281
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Conjecture: For k > 1, k^(m + 1) == -1 (mod m) has an infinite number of positive solutions.
Conjecture: For k > 1, if f(1) = p(1) equals one of the prime factors of k^2 + 1, p(i+1) equals one of the prime factors of k^(f(i)+1) + 1 greater than p(i), f(i+1) = f(i)*p(i+1), then k^(f(i) + 1) == -1 (mod f(i)) for all integers i. (Especially in this sequence, k = 4, so {f(i)} can be 17, 4097, 4298117633, ...) - Jinyuan Wang, Nov 16 2019
|
|
LINKS
|
|
|
PROG
|
(Magma) [n + 1: n in [0..5000000] | Modexp(4, n + 2, n + 1) eq n ];
(PARI) isok(m) = Mod(4, m)^(m+1) == -1; \\ Jinyuan Wang, Nov 16 2019
|
|
CROSSREFS
|
Solutions to k^(m + 1) + 1 == -1 (mod m): A296369 (k = 2), A328230 (k = 3).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|