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.

A029909 Starting with n (but omitting the primes), repeatedly sum prime factors (counted with multiplicity) until reaching a limit.

Table of values

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

List of values

[0, 4, 5, 5, 5, 7, 7, 5, 5, 5, 5, 5, 7, 13, 5, 7, 5, 5, 11, 7, 7, 5, 19, 7, 7, 7, 5, 11, 7, 5, 11, 7, 11, 5, 7, 5, 17, 11, 5, 13, 13, 31, 7, 5, 13, 7, 5, 5, 7, 5, 5, 7, 5, 13, 23, 5, 5, 13, 7, 43, 5, 13, 11, 7, 17, 13, 5, 5, 19, 5, 5, 13, 5, 17, 5, 13, 19, 5, 5, 13, 5, 11, 5, 5, 11, 5]