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.

A290839 a(n) = smallest prime p such that 2p + 2n - 1 is prime.

Table of values

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

List of values

[2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 5, 3, 2, 2, 7, 3, 2, 3, 2, 2, 3, 2, 7, 3, 2, 5, 3, 2, 2, 7, 3, 2, 3, 2, 2, 13, 3, 2, 3, 2, 11, 3, 2, 5, 7, 3, 2, 3, 2, 2, 3, 2, 2, 3, 2, 13, 7, 11, 5, 19, 3, 2, 3, 2, 5, 3, 2, 2, 7, 5, 5, 3, 2, 2, 7, 3, 2, 13, 3, 2, 3, 2, 7, 3, 2]

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

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