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.

A324037 The minimal number of iterations to reach 1 of the modified reduced Collatz function, defined for odd numbers 1 + 2*n in A324036 (assuming the Collatz conjecture).

Table of values

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

List of values

[0, 2, 1, 6, 7, 5, 3, 7, 4, 8, 2, 6, 9, 48, 7, 46, 10, 5, 8, 14, 47, 11, 6, 45, 9, 10, 4, 49, 12, 13, 8, 47, 10, 11, 5, 44, 50, 5, 9, 15, 9, 48, 3, 12, 12, 40, 7, 46, 51, 10, 10, 38, 16, 43, 49, 30, 4, 13, 8, 14, 41, 19, 47, 20, 52, 11, 11, 16, 39, 17, 6]