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.

A168141 a(n) = pi(n + 1) - pi(n - 2), where pi is the prime counting function.

Table of values

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

List of values

[1, 2, 2, 2, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0]