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.

A096502 a(n) = k is the smallest exponent k such that 2^k - (2n+1) is a prime number, or 0 if no such k exists.

Table of values

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

List of values

[2, 3, 3, 39, 4, 4, 4, 5, 6, 5, 5, 6, 5, 5, 5, 7, 6, 6, 11, 7, 6, 29, 6, 6, 7, 6, 6, 7, 6, 6, 6, 8, 8, 7, 7, 10, 9, 7, 8, 9, 7, 8, 7, 7, 8, 7, 8, 10, 7, 7, 26, 9, 7, 8, 7, 7, 10, 7, 7, 8, 7, 7, 7, 47, 8, 14, 9, 11, 10, 9, 10, 8, 9, 8, 8, 31, 8, 8, 15, 8, 10, 9]

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

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