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.

A278792 a(n) is the positive integer x such that 3^((M-1)/(2*p)) == -2^x (mod M), where p > 2 is prime, M=2^p-1 is the n-th Mersenne prime and x < p.

Table of values

n a(n)
2 2
3 2
4 1
5 6
6 16
7 4
8 5
9 25
10 18
11 20
12 45
13 61
14 91
15 939
16 817
17 336
18 862
19 2533
20 3404
21 2822
22 3136
23 1554
24 9371
25 10712
26 21311
27 44296
28 68185
29 66909
30 31147
31 25648

List of values

[2, 2, 1, 6, 16, 4, 5, 25, 18, 20, 45, 61, 91, 939, 817, 336, 862, 2533, 3404, 2822, 3136, 1554, 9371, 10712, 21311, 44296, 68185, 66909, 31147, 25648]