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.
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.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =5a(6) =32a(7) =10a(8) =64a(9) =3a(10) =20a(11) =21a(12) =128a(13) =6a(14) =40a(15) =42a(16) =256a(17) =12a(18) =13a(19) =80a(20) =84a(21) =85a(22) =512a(23) =24a(24) =26a(25) =160a(26) =168a(27) =170a(28) =1024a(29) =48
External references
- oeis: A088975