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.

A084596 a(n) is the number of times n is in sequence A014085; i.e., there are exactly a(n) cases where there are exactly n primes between m^2 and (m+1)^2 for m >= 0.

Table of values

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

List of values

[1, 0, 4, 3, 4, 4, 4, 5, 4, 7, 5, 5, 5, 7, 2, 7, 5, 6, 4, 4, 5, 10, 6, 9, 7, 5, 2, 5, 6, 6, 10, 4, 5, 11, 5, 3, 8, 3, 8, 9, 7, 10, 5, 4, 6, 8, 8, 5, 6, 10, 8, 9, 4, 4, 6, 7, 8, 7, 5, 10, 9, 9, 6, 8, 7, 7, 7, 8, 6, 3, 5, 8, 4, 8, 14, 8, 7, 9, 10, 6, 9, 6, 7, 6, 6, 8, 10, 4, 8, 7, 6, 8, 5, 14, 6, 7, 11, 7, 10, 8]