cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Table of values

n a(n)
1 3
2 5
3 13
4 31
5 61
6 127
7 2203
8 4253
9 9941
10 19937
11 23209
12 86243
13 110503
14 132049
15 756839
16 1398269
17 2976221
18 3021377
19 6972593
20 13466917
21 20996011
22 25964951
23 37156667
24 43112609
25 77232917

List of values

[3, 5, 13, 31, 61, 127, 2203, 4253, 9941, 19937, 23209, 86243, 110503, 132049, 756839, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011, 25964951, 37156667, 43112609, 77232917]