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.

A159585 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 4
3 10
4 4
5 46
6 22
7 16
8 46
9 66
10 136
11 166
12 124
13 636
14 550
15 1474
16 3066
17 1656
18 1816
19 3708
20 9436
21 1746
22 3696
23 11262
24 40138
25 25900
26 20808
27 60340
28 58818

List of values

[2, 4, 10, 4, 46, 22, 16, 46, 66, 136, 166, 124, 636, 550, 1474, 3066, 1656, 1816, 3708, 9436, 1746, 3696, 11262, 40138, 25900, 20808, 60340, 58818]

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

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