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.

A373592 Number of primes congruent to 2 modulo 3 dividing n (with multiplicity).

Table of values

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

List of values

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