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.

A061376 a(n) = f(n) + f(f(n)) where f(n) = 0 if n <= 1 or a prime, otherwise f(n) = sum of distinct primes dividing n.

Table of values

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

List of values

[0, 0, 0, 2, 0, 5, 0, 2, 3, 7, 0, 5, 0, 12, 10, 2, 0, 5, 0, 7, 17, 13, 0, 5, 5, 23, 3, 12, 0, 17, 0, 2, 23, 19, 17, 5, 0, 31, 18, 7, 0, 17, 0, 13, 10, 30, 0, 5, 7, 7, 27, 23, 0, 5, 18, 12, 35, 31, 0, 17, 0, 47, 17, 2, 23, 18, 0, 19, 41, 23, 0, 5, 0, 55, 10, 31, 23, 23, 0, 7]