

A354168


Let M_p = 2^p1 be a Mersenne prime, where p is an odd prime. Sequence lists p such that b_{p2} == 2^((p+1)/2) mod M_p, where {b_k} is defined in the Comments.


1



7, 17, 19, 89, 107, 521, 607, 1279, 2281, 3217, 4423, 9689, 11213, 21701, 44497, 216091, 859433, 1257787, 24036583, 30402457, 32582657, 42643801, 57885161, 74207281, 82589933
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Let M_p = 2^p1 (not necessarily a prime) where p is an odd prime, and define b_1 = 4; b_k = b_{k1}^2  2 (mod M_p) for k >= 2.
The LucasLehmer theorem says that M_p is a prime iff b_{p1} == 0 (mod M_p).
Furthermore, if M_p is a prime, then b_{p2} is congruent to + 2^((p+1)/2) (mod M_p).
This partitions the Mersenne prime exponents A000043 into two classes, listed here and in A354167.


REFERENCES

J. B. Cosgrave, A MersenneWieferich Odyssey, Manuscript, May 2022. See Section 16.1.


LINKS



CROSSREFS

Cf. A123271 (sign of the penultimate term of the LucasLehmer sequence).


KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



