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.

A278495 a(n) = number of primes in range [n^2, (n+1)^2] that are leaves in "the least squares beanstalk" tree.

Table of values

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

List of values

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