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.

A137906 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 1
3 1
4 1
5 1
6 4
7 1
8 27
9 14
10 34
11 6
12 132
13 97
14 1
15 500
16 1816
17 1292
18 136
19 2445
20 15
21 1934
22 5472
23 1584
24 2734
25 21022
26 5870

List of values

[1, 1, 1, 1, 1, 4, 1, 27, 14, 34, 6, 132, 97, 1, 500, 1816, 1292, 136, 2445, 15, 1934, 5472, 1584, 2734, 21022, 5870]