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