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.

A378929 Number of steps it takes for the chain of f(n) = n * d(n) / gcd(n, d(n))^2 to reach a cycle from a starting number n.

Table of values

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

List of values

[0, 1, 1, 3, 1, 0, 1, 2, 2, 0, 1, 2, 1, 0, 3, 4, 1, 2, 1, 4, 3, 0, 1, 2, 1, 0, 4, 4, 1, 3, 1, 6, 3, 0, 1, 4, 1, 0, 3, 2, 1, 3, 1, 4, 4, 0, 1, 5, 1, 0, 3, 4, 1, 4, 1, 2, 3, 0, 1, 2, 1, 0, 4, 8, 1, 3, 1, 4, 3, 0, 1, 1, 1, 0, 0, 4, 1, 3, 1, 3, 1, 0, 1, 2, 1, 0, 3, 2]