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.

A096839 Number of primes in the neighborhood of n^2 with radius ceiling(log(n^2)).

Table of values

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

List of values

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