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.

A239666 a(n) = least number k such that n*k^n+1 is prime, or 0 if no such number exists.

Table of values

n a(n)
1 1
2 1
3 4
4 1
5 8
6 1
7 4
8 3
9 10
10 1
11 42
12 1
13 60
14 15
15 22
16 1
17 8
18 1
19 198
20 42
21 10
22 1
23 8
24 115
25 34
26 21
27 0
28 1
29 54
30 1
31 130
32 3
33 4
34 7
35 72
36 1
37 778
38 204
39 30
40 1
41 108
42 1
43 178
44 15
45 14
46 1
47 924
48 28
49 234
50 63
51 1376
52 1
53 44
54 3
55 16
56 27
57 256
58 1
59 180
60 1
61 706
62 51
63 98
64 0
65 546
66 1
67 4
68 153
69 150
70 1
71 170

List of values

[1, 1, 4, 1, 8, 1, 4, 3, 10, 1, 42, 1, 60, 15, 22, 1, 8, 1, 198, 42, 10, 1, 8, 115, 34, 21, 0, 1, 54, 1, 130, 3, 4, 7, 72, 1, 778, 204, 30, 1, 108, 1, 178, 15, 14, 1, 924, 28, 234, 63, 1376, 1, 44, 3, 16, 27, 256, 1, 180, 1, 706, 51, 98, 0, 546, 1, 4, 153, 150, 1, 170]