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.

A323077 Number of iterations of map x -> (x - (largest divisor d < x)) needed to reach 1 or a prime, when starting at x = n.

Table of values

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

List of values

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