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.

A345706 a(n) is the least exponent k > 0 of the n-th prime such that (Product_{j=1..n-1} prime(j)) * prime(n)^k + 1 is a Euclid-Pocklington prime (A053341).

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 6
7 5
8 12
9 9
10 8
11 10
12 9
13 20
14 14
15 24
16 18
17 12
18 16
19 58
20 26
21 20
22 30
23 42
24 322
25 276
26 27
27 25
28 48
29 27
30 208
31 38
32 77
33 48
34 55
35 414
36 94
37 67
38 107
39 53
40 33
41 56
42 38
43 34
44 52
45 60
46 60
47 483
48 41
49 155
50 105
51 43
52 476
53 68
54 126
55 51
56 387
57 49
58 121
59 46
60 65
61 395
62 68
63 78
64 308

List of values

[1, 1, 2, 2, 3, 6, 5, 12, 9, 8, 10, 9, 20, 14, 24, 18, 12, 16, 58, 26, 20, 30, 42, 322, 276, 27, 25, 48, 27, 208, 38, 77, 48, 55, 414, 94, 67, 107, 53, 33, 56, 38, 34, 52, 60, 60, 483, 41, 155, 105, 43, 476, 68, 126, 51, 387, 49, 121, 46, 65, 395, 68, 78, 308]