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.

A084138 a(n) is the number of times n is in sequence A060715, i.e., there are exactly a(n) cases where there are exactly n primes between m and 2m, exclusively, for m > 0.

Table of values

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

List of values

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