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.

A058974 a(n) = 0 if n = 1 or a prime, otherwise a(n) = s + a(s) iterated until no change occurs, where s (A008472) is 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 25
27 3
28 12
29 0
30 17
31 0
32 2
33 26
34 19
35 17
36 5
37 0
38 38
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 25
53 0
54 5
55 18
56 12
57 35
58 31
59 0
60 17
61 0
62 59
63 17
64 2
65 23
66 18
67 0
68 19
69 51
70 26
71 0
72 5
73 0
74 57
75 10
76 38
77 23
78 23
79 0
80 7
81 3
82 43
83 0
84 17
85 35
86 55
87 34
88 13
89 0

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, 25, 3, 12, 0, 17, 0, 2, 26, 19, 17, 5, 0, 38, 18, 7, 0, 17, 0, 13, 10, 30, 0, 5, 7, 7, 27, 25, 0, 5, 18, 12, 35, 31, 0, 17, 0, 59, 17, 2, 23, 18, 0, 19, 51, 26, 0, 5, 0, 57, 10, 38, 23, 23, 0, 7, 3, 43, 0, 17, 35, 55, 34, 13, 0]