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.

A346136 a(n) is the number of iterations that n requires to reach 1 under the map n -> A346063(n).

Table of values

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

List of values

[0, 1, 2, 2, 3, 3, 1, 4, 1, 4, 3, 3, 4, 3, 2, 4, 4, 5, 2, 3, 9, 11, 8, 6, 10, 12, 6, 7, 2, 8, 4, 3, 6, 4, 10, 7, 2, 7, 4, 9, 4, 5, 4, 1, 8, 7, 6, 11, 2, 73, 5, 12, 5, 6, 1, 5, 2, 4, 34, 7, 5, 5, 2, 51, 7, 2, 5, 3, 5, 5, 3, 15, 6, 5, 2, 4, 10]