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.

A063958 Sum of the non-unitary prime divisors of n: sum of those prime divisors for which the exponent in the prime factorization exceeds 1.

Table of values

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

List of values

[0, 0, 0, 2, 0, 0, 0, 2, 3, 0, 0, 2, 0, 0, 0, 2, 0, 3, 0, 2, 0, 0, 0, 2, 5, 0, 3, 2, 0, 0, 0, 2, 0, 0, 0, 5, 0, 0, 0, 2, 0, 0, 0, 2, 3, 0, 0, 2, 7, 5, 0, 2, 0, 3, 0, 2, 0, 0, 0, 2, 0, 0, 3, 2, 0, 0, 0, 2, 0, 0, 0, 5, 0, 0, 5, 2, 0, 0, 0, 2, 3, 0, 0, 2, 0, 0, 0, 2, 0, 3, 0, 2, 0, 0, 0, 2, 0, 7, 3, 7, 0, 0, 0, 2, 0]