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.

A074905 a(n) = number of terms in A030229 between prime(n) and prime(n+1).

Table of values

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

List of values

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