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.

A260758 Least k > 0 such that M(n)^2 + 2k is prime, where M(n) = 2^n - 1 = A000225(n).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 3
6 10
7 5
8 1
9 3
10 14
11 11
12 4
13 5
14 4
15 5
16 8
17 30
18 2
19 6
20 1
21 8
22 29
23 12
24 29
25 30
26 11
27 2
28 4
29 5
30 19
31 29
32 2
33 9
34 7
35 11
36 4
37 74
38 16
39 24
40 8
41 18
42 10
43 30
44 56
45 15
46 35
47 24
48 4
49 35
50 19
51 111
52 19
53 18
54 1
55 57
56 8
57 20
58 14
59 2
60 2
61 48
62 29
63 26
64 92
65 24
66 19
67 155
68 2
69 78
70 35
71 56
72 113
73 33
74 70
75 32
76 7

List of values

[1, 1, 1, 2, 1, 3, 10, 5, 1, 3, 14, 11, 4, 5, 4, 5, 8, 30, 2, 6, 1, 8, 29, 12, 29, 30, 11, 2, 4, 5, 19, 29, 2, 9, 7, 11, 4, 74, 16, 24, 8, 18, 10, 30, 56, 15, 35, 24, 4, 35, 19, 111, 19, 18, 1, 57, 8, 20, 14, 2, 2, 48, 29, 26, 92, 24, 19, 155, 2, 78, 35, 56, 113, 33, 70, 32, 7]