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.

A137909 Least k such that k*(2^p-1)*(k*(2^p-1)+1)+1 is prime, where 2^p-1 runs through the Mersenne primes.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 17
6 8
7 3
8 6
9 96
10 9
11 224
12 33
13 260
14 1044
15 2397
16 3
17 1487
18 657
19 9602
20 2133
21 18438
22 93
23 17273
24 32583
25 66539
26 9632
27 1431
28 100440
29 150857

List of values

[1, 2, 2, 3, 17, 8, 3, 6, 96, 9, 224, 33, 260, 1044, 2397, 3, 1487, 657, 9602, 2133, 18438, 93, 17273, 32583, 66539, 9632, 1431, 100440, 150857]