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.

A330437 Length of trajectory of n under the map n -> n - 1 + n/gpf(n) or 0 if no fixed point is reached, where gpf(n) is the greatest prime factor of n.

Table of values

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

List of values

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