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.

A005090 Number of primes == 2 mod 3 dividing n.

Table of values

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

List of values

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