A335569 - cp's OEIS frontend

A335569 a(n) is the maximum height achieved in the Collatz ('3x+1') problem when starting from numbers in the range [2^n, 2^(n+1)).

n	a(n)
0	0
1	7
2	16
3	19
4	111
5	112
6	118
7	127
8	143
9	178
10	181
11	237
12	261
13	275
14	307
15	339
16	353
17	442
18	469
19	524
20	556
21	596
22	664
23	704
24	705
25	949
26	950
27	956
28	964
29	986
30	1008
31	1050
32	1131
33	1210
34	1219
35	1220
36	1234
37	1307
38	1321

[0, 7, 16, 19, 111, 112, 118, 127, 143, 178, 181, 237, 261, 275, 307, 339, 353, 442, 469, 524, 556, 596, 664, 704, 705, 949, 950, 956, 964, 986, 1008, 1050, 1131, 1210, 1219, 1220, 1234, 1307, 1321]

cp's OEIS Frontend

A335569 a(n) is the maximum height achieved in the Collatz ('3x+1') problem when starting from numbers in the range [2^n, 2^(n+1)).

Table of values

List of values