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.

A349366 Number of primes p such that prime(n) < p <= prime(n) + (log(prime(n)))^2 - log(prime(n)) - 1.

Table of values

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

List of values

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