A088975 - cp's OEIS frontend

A088975 Breadth-first traversal of the Collatz tree, with the odd child of each node traversed prior to its even 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	5
6	32
7	10
8	64
9	3
10	20
11	21
12	128
13	6
14	40
15	42
16	256
17	12
18	13
19	80
20	84
21	85
22	512
23	24
24	26
25	160
26	168
27	170
28	1024
29	48
30	52
31	53
32	320
33	336
34	340
35	341
36	2048
37	96
38	17
39	104
40	106
41	640
42	672
43	113
44	680
45	682
46	4096
47	192
48	34
49	208
50	35
51	212
52	213
53	1280
54	1344
55	226
56	1360
57	227
58	1364

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

cp's OEIS Frontend

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

Table of values

List of values