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.

A096509 Number of prime-powers [including primes] in the (up and down) neighborhood of n with Ceiling[Log[n]] radius.

Table of values

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

List of values

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