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.

A176867 Least odd number that requires n Collatz (3x+1) iterations to reach 1, or zero if there is no such number.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 5
6 0
7 3
8 0
9 13
10 0
11 53
12 17
13 35
14 11
15 23
16 7
17 15
18 29
19 9
20 19
21 37
22 77
23 25
24 49
25 99
26 33
27 65
28 131
29 43
30 87
31 173
32 57
33 115
34 39
35 79
36 153
37 305
38 105
39 203
40 407
41 135
42 271
43 541
44 185
45 361
46 123
47 247
48 481
49 169
50 329
51 641
52 219
53 427
54 159
55 295
56 569
57 1139
58 379
59 759
60 283
61 505
62 1011

List of values

[1, 0, 0, 0, 0, 5, 0, 3, 0, 13, 0, 53, 17, 35, 11, 23, 7, 15, 29, 9, 19, 37, 77, 25, 49, 99, 33, 65, 131, 43, 87, 173, 57, 115, 39, 79, 153, 305, 105, 203, 407, 135, 271, 541, 185, 361, 123, 247, 481, 169, 329, 641, 219, 427, 159, 295, 569, 1139, 379, 759, 283, 505, 1011]