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.

A176868 Greatest 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 21
8 0
9 85
10 0
11 341
12 113
13 1365
14 453
15 5461
16 1813
17 21845
18 7281
19 87381
20 29125
21 349525
22 116501
23 1398101
24 466033
25 5592405
26 1864133
27 22369621
28 7456533
29 89478485
30 29826161
31 357913941
32 119304645
33 1431655765
34 477218581
35 5726623061
36 1908874353

List of values

[1, 0, 0, 0, 0, 5, 0, 21, 0, 85, 0, 341, 113, 1365, 453, 5461, 1813, 21845, 7281, 87381, 29125, 349525, 116501, 1398101, 466033, 5592405, 1864133, 22369621, 7456533, 89478485, 29826161, 357913941, 119304645, 1431655765, 477218581, 5726623061, 1908874353]