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.

A245476 Least number k > 1 such that k^n + k + 1 is prime, or 0 if no such number exists.

Table of values

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

List of values

[2, 2, 2, 2, 0, 2, 2, 0, 3, 3, 0, 2, 5, 0, 2, 2, 0, 2, 8, 0, 6, 3, 0, 6, 15, 0, 6, 2, 0, 2, 23, 0, 23, 56, 0, 15, 114, 0, 14, 11, 0, 3, 14, 0, 29, 110, 0, 21, 9, 0, 53, 59, 0, 6, 2, 0, 3, 29, 0, 71, 21, 0, 146, 17, 0, 35, 2, 0, 9, 6, 0, 77, 41, 0, 27, 176, 0, 153, 21, 0, 39, 32, 0, 2, 314, 0, 3, 5, 0, 66, 44, 0, 234]