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.

A247244 Smallest prime p such that (n^p + (n+1)^p)/(2n+1) is prime, or -1 if no such p exists.

Table of values

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

List of values

[3, 3, 3, 5, 3, 3, 7, 3, 7, 53, 47, 3, 7, 3, 3, 41, 3, 5, 11, 3, 3, 11, 11, 3, 5, 103, 3, 37, 17, 7, 13, 37, 3, 269, 17, 5, 17, 3, 5, 139, 3, 11, 78697, 5, 17, 3671, 13, 491, 5, 3, 31, 43, 7, 3, 7, 2633, 3, 7, 3, 5, 349, 3, 41, 31, 5, 3, 7, 127, 3, 19, 3, 11, 19, 101, 3, 5, 3, 3]