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.

A354168 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 7
2 17
3 19
4 89
5 107
6 521
7 607
8 1279
9 2281
10 3217
11 4423
12 9689
13 11213
14 21701
15 44497
16 216091
17 859433
18 1257787
19 24036583
20 30402457
21 32582657
22 42643801
23 57885161
24 74207281
25 82589933

List of values

[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]