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.

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

Table of values

n a(n)
1 2
2 3
3 2
4 0
5 2
6 175
7 16
8 3
9 2
10 539
11 32
12 221
13 118
14 417
15 2
16 85
17 14
18 133
19 22
20 81
21 76
22 115
23 12
24 55
25 28
26 15
27 0
28 2465
29 110
30 31
31 232
32 117
33 230
34 3
35 12
36 851
37 4
38 375
39 2
40 1599
41 48
42 5461
43 46
44 15
45 218
46 6815
47 78
48 7
49 100
50 993
51 28
52 901
53 624
54 13
55 252
56 183
57 226
58 43247
59 104
60 5063
61 1348
62 777
63 1294
64 0
65 1806

List of values

[2, 3, 2, 0, 2, 175, 16, 3, 2, 539, 32, 221, 118, 417, 2, 85, 14, 133, 22, 81, 76, 115, 12, 55, 28, 15, 0, 2465, 110, 31, 232, 117, 230, 3, 12, 851, 4, 375, 2, 1599, 48, 5461, 46, 15, 218, 6815, 78, 7, 100, 993, 28, 901, 624, 13, 252, 183, 226, 43247, 104, 5063, 1348, 777, 1294, 0, 1806]