A088976 - cp's OEIS frontend

A088976 Breadth-first traversal of the Collatz tree, with the even child of each node traversed prior to its odd child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.

n	a(n)
0	1
1	2
2	4
3	8
4	16
5	32
6	5
7	64
8	10
9	128
10	21
11	20
12	3
13	256
14	42
15	40
16	6
17	512
18	85
19	84
20	80
21	13
22	12
23	1024
24	170
25	168
26	160
27	26
28	24
29	2048
30	341
31	340
32	336
33	320
34	53
35	52
36	48
37	4096
38	682
39	680
40	113
41	672
42	640
43	106
44	104
45	17
46	96
47	8192
48	1365
49	1364
50	227
51	1360
52	226
53	1344
54	1280
55	213
56	212
57	35
58	208

[1, 2, 4, 8, 16, 32, 5, 64, 10, 128, 21, 20, 3, 256, 42, 40, 6, 512, 85, 84, 80, 13, 12, 1024, 170, 168, 160, 26, 24, 2048, 341, 340, 336, 320, 53, 52, 48, 4096, 682, 680, 113, 672, 640, 106, 104, 17, 96, 8192, 1365, 1364, 227, 1360, 226, 1344, 1280, 213, 212, 35, 208]

cp's OEIS Frontend

A088976 Breadth-first traversal of the Collatz tree, with the even child of each node traversed prior to its odd child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.

Table of values

List of values