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.

A359395 Least odd prime p in position n in the prime factorization of M(p) = 2^(p - 1) - 1.

Table of values

n a(n)
1 3
2 5
3 17
4 13
5 71
6 37
7 157
8 61
9 211
10 313
11 1289
12 241
13 337
14 181
15 577
16 601
17 541
18 1381
19 421
20 1201
21 1009
22 1621
23 1873
24 3433
25 4561
26 1801
27 3301
28 2161
29 3061
30 5281
31 3361
32 2521
33 7393
34 6481
35 4201
36 4621
37 8737
38 9181
39 6301
40 19501
41 7561
42 16633
43 12241
44 26881
45 15601
46 9241
47 21001
48 14281
49 12601
50 53551

List of values

[3, 5, 17, 13, 71, 37, 157, 61, 211, 313, 1289, 241, 337, 181, 577, 601, 541, 1381, 421, 1201, 1009, 1621, 1873, 3433, 4561, 1801, 3301, 2161, 3061, 5281, 3361, 2521, 7393, 6481, 4201, 4621, 8737, 9181, 6301, 19501, 7561, 16633, 12241, 26881, 15601, 9241, 21001, 14281, 12601, 53551]