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.

A225633 Number of steps to reach a fixed point (A003418(n)), when starting from partition {1+1+1+...+1} of n and continuing with the process described in A225632.

Table of values

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

List of values

[0, 0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 5, 5, 5, 6, 6, 7, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 8, 9, 10, 10, 9, 10, 9, 11, 11, 11, 11, 12, 11, 12, 12, 12, 11, 12, 12, 12, 11, 11, 11, 12, 12, 13, 12, 12, 13, 13, 12, 13, 12, 12, 12, 13, 13, 14, 14]