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.

A005074 Sum of primes = 2 mod 3 dividing n.

Table of values

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

List of values

[0, 2, 0, 2, 5, 2, 0, 2, 0, 7, 11, 2, 0, 2, 5, 2, 17, 2, 0, 7, 0, 13, 23, 2, 5, 2, 0, 2, 29, 7, 0, 2, 11, 19, 5, 2, 0, 2, 0, 7, 41, 2, 0, 13, 5, 25, 47, 2, 0, 7, 17, 2, 53, 2, 16, 2, 0, 31, 59, 7, 0, 2, 0, 2, 5, 13, 0, 19, 23, 7, 71, 2, 0, 2, 5, 2, 11, 2, 0, 7, 0, 43, 83, 2, 22, 2, 29, 13, 89, 7, 0, 25, 0, 49, 5]