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.

A101416 Nearest k to j such that k*(2^j-1)-1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.

Table of values

n a(n)
1 2
2 2
3 2
4 6
5 20
6 14
7 32
8 90
9 72
10 80
11 230
12 80
13 560
14 740
15 1542
16 1782
17 450
18 828
19 2562
20 3936
21 12474
22 9288
23 10224
24 16022
25 11088
26 31034
27 53972
28 92372

List of values

[2, 2, 2, 6, 20, 14, 32, 90, 72, 80, 230, 80, 560, 740, 1542, 1782, 450, 828, 2562, 3936, 12474, 9288, 10224, 16022, 11088, 31034, 53972, 92372]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.