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.

A135546 Let p be the n-th prime and let g be the order of 2 mod p (see A014664). Then if g is even, a(n) = p*(2^(g/2) - 1), otherwise a(n) = 2^g - 1.

Table of values

n a(n)
2 3
3 15
4 7
5 341
6 819
7 255
8 9709
9 2047
10 475107
11 31
12 9699291
13 41943
14 5461
15 8388607
16 3556769739
17 31675383749
18 65498251203
19 575525617597
20 34359738367
21 511
22 549755813887
23 182518930210733
24 2047
25 1627389855
26 113715890591104923
27 2251799813685247
28 963770320257286037

List of values

[3, 15, 7, 341, 819, 255, 9709, 2047, 475107, 31, 9699291, 41943, 5461, 8388607, 3556769739, 31675383749, 65498251203, 575525617597, 34359738367, 511, 549755813887, 182518930210733, 2047, 1627389855, 113715890591104923, 2251799813685247, 963770320257286037]