The number of gaps in the set of positive integers which need at most n steps of the Collatz iteration to reach 1.
A391769
The number of gaps in the set of positive integers which need at most n steps of the Collatz iteration to reach 1.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =2a(4) =3a(5) =4a(6) =6a(7) =7a(8) =10a(9) =14a(10) =20a(11) =26a(12) =35a(13) =45a(14) =57a(15) =73a(16) =94a(17) =121a(18) =159a(19) =202a(20) =255a(21) =322a(22) =411a(23) =520a(24) =658a(25) =836a(26) =1057a(27) =1339a(28) =1696a(29) =2143
External references
- oeis: A391769