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.

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

Table of values

n a(n)
1 3
2 2
3 1
4 1
5 4
6 1
7 8
8 1
9 40
10 3
11 10
12 1
13 56
14 1
15 10
16 0
17 46
18 1
19 6
20 1
21 42
22 51
23 4
24 1
25 8
26 67
27 0
28 18
29 102
30 1
31 98
32 1
33 38
34 6
35 136
36 0
37 90
38 1
39 10
40 3
41 52
42 1
43 12
44 1
45 18
46 3
47 28
48 1
49 72
50 165
51 40
52 657
53 418
54 1
55 44
56 205
57 94
58 9
59 426
60 1
61 482
62 1
63 4
64 0
65 418
66 252
67 38
68 1
69 400
70 165
71 28
72 1
73 140

List of values

[3, 2, 1, 1, 4, 1, 8, 1, 40, 3, 10, 1, 56, 1, 10, 0, 46, 1, 6, 1, 42, 51, 4, 1, 8, 67, 0, 18, 102, 1, 98, 1, 38, 6, 136, 0, 90, 1, 10, 3, 52, 1, 12, 1, 18, 3, 28, 1, 72, 165, 40, 657, 418, 1, 44, 205, 94, 9, 426, 1, 482, 1, 4, 0, 418, 252, 38, 1, 400, 165, 28, 1, 140]