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.

A323076 Number of iterations of map x -> 1+(x-(largest divisor d < x)), starting from x=n, needed to reach a fixed point, which is always either a prime or 1.

Table of values

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

List of values

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