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.

A210210 Least number k among 1, ..., n such that pi(p+2*n) - pi(p+n) = pi(p+n) - pi(p) > 0 with p = prime(k), or 0 if such a number k does not exist, where pi(.) is given by A000720.

Table of values

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

List of values

[0, 1, 2, 4, 2, 2, 4, 1, 2, 3, 3, 6, 2, 9, 4, 6, 7, 4, 4, 6, 3, 3, 3, 5, 2, 6, 4, 4, 4, 8, 3, 4, 6, 3, 3, 8, 8, 6, 6, 7, 7, 10, 7, 6, 14, 5, 5, 8, 5, 4, 6, 3, 3, 13, 2, 14, 12, 12, 12, 18, 18, 18, 11, 11, 11, 17, 10, 11, 11, 16, 16, 9, 9, 16, 15, 16, 8, 14, 14, 14]