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.

A324657 a(n) is the number of successive primorials A002110(i) larger than prime(n) that need to be tried before sum prime(n)+A002110(i) is found to be composite.

Table of values

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

List of values

[0, 0, 1, 1, 1, 2, 2, 0, 3, 4, 2, 0, 5, 0, 2, 1, 1, 3, 3, 2, 5, 0, 3, 0, 1, 2, 1, 4, 0, 0, 2, 0, 2, 1, 2, 0, 3, 2, 0, 1, 1, 0, 1, 0, 0, 1, 2, 0, 0, 2, 1, 2, 3, 0, 0, 0, 1, 0, 0, 1, 4, 0, 1, 2, 0, 0, 0, 4, 1, 1, 1, 0, 1, 2, 1, 1, 1, 3, 2, 1, 2, 1, 1, 0, 2, 1, 0, 1, 0, 0, 2, 4, 2, 1, 0, 0, 3, 0, 4, 1, 3, 0, 0, 1, 0]