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.

A331032 Number of iterations of n -> n + gpf(n) needed for the trajectory of n to join the trajectory of A076271, where gpf(n) is the greatest prime factor of n.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 4, 2, 0, 1, 6, 0, 10, 3, 0, 4, 12, 3, 16, 0, 2, 5, 18, 2, 0, 9, 1, 1, 22, 0, 28, 12, 4, 11, 0, 9, 30, 15, 8, 5, 36, 0, 40, 3, 4, 17, 42, 11, 0, 3, 10, 7, 46, 15, 2, 0, 14, 21, 52, 7, 58, 27, 0, 2, 6, 1, 60, 9, 16, 0, 66, 11, 70, 29, 10, 13]