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.

A018845 Number of iterations required for the sum of n and its prime divisors = t to reach a prime (where t replaces n in each iteration) in A016837.

Table of values

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

List of values

[4, 2, 3, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 1, 3, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 3, 3, 2, 3, 5, 4, 1, 1, 1, 2, 2, 1, 2, 2, 10, 3, 2, 1, 6, 1, 3, 1, 5, 5, 1, 5, 3, 2, 1, 5, 1, 1, 2, 7, 3, 4, 4, 4, 1, 10, 3, 1, 4, 6, 3, 6, 3, 1, 6, 3, 4, 2, 2, 2, 2, 9, 2, 5, 1, 1, 3]