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.

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

Table of values

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

List of values

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