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.

A346149 a(n) is the least integer k > 1 such that n^k + n + 1 is prime, or 0 if there is no such k.

Table of values

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

List of values

[2, 2, 2, 0, 2, 2, 0, 2, 3, 0, 4, 2, 0, 2, 2, 0, 2, 3, 0, 2, 2, 0, 9, 2, 0, 4, 2, 0, 3, 3, 0, 3, 2, 0, 15, 4, 0, 2, 3, 0, 2, 3, 0, 3, 6, 0, 4, 3, 0, 2, 9, 0, 3, 2, 0, 3, 2, 0, 2, 3, 0, 2, 73, 0, 12, 2, 0, 595, 2, 0, 2, 4, 0, 3, 2, 0, 2, 2, 0, 2, 7, 0, 3, 30, 0, 21, 3, 0, 2, 2, 0, 7, 67, 0, 3]