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.

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

Table of values

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

List of values

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