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.

A005070 Sum of primes == 1 (mod 3) dividing n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 13, 7, 0, 0, 0, 0, 19, 0, 7, 0, 0, 0, 0, 13, 0, 7, 0, 0, 31, 0, 0, 0, 7, 0, 37, 19, 13, 0, 0, 7, 43, 0, 0, 0, 0, 0, 7, 0, 0, 13, 0, 0, 0, 7, 19, 0, 0, 0, 61, 31, 7, 0, 13, 0, 67, 0, 0, 7, 0, 0, 73, 37, 0, 19, 7, 13, 79, 0, 0, 0, 0, 7, 0, 43, 0, 0, 0, 0, 20, 0, 31, 0, 19, 0, 97, 7, 0, 0, 0, 0, 103, 13, 7, 0, 0, 0, 109, 0, 37]