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.

A321944 Starting from n, repeatedly compute the sum of the prime divisors until a fixed point or 0 is reached; a(n) is the number of terms, including n.

Table of values

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

List of values

[2, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 3, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 2, 4, 2, 3, 1, 3, 1, 2, 4, 2, 3, 2, 1, 4, 3, 2, 1, 3, 1, 2, 3, 3, 1, 2, 2, 2, 3, 4, 1, 2, 3, 3, 3, 2, 1, 3, 1, 5, 3, 2, 3, 3, 1, 2, 5, 4, 1, 2, 1, 4, 3, 4, 3, 3, 1, 2, 2, 2, 1, 3, 3, 4, 3, 2, 1, 3]