A264749 a(n) = floor(n/BL(n)) where BL(n) = A070939(n) is the binary length of n.
0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Programs
-
Haskell
a264749 n = div n $ a070939 n -- Reinhard Zumkeller, Dec 05 2015
-
Mathematica
{0}~Join~Table[Floor[n/IntegerLength[n, 2]], {n, 84}] (* Michael De Vlieger, Dec 01 2015 *)
-
PARI
a(n) = if (n, n\#binary(n)); \\ Michel Marcus, Dec 01 2015
-
Python
for n in range(88): print(n // (len(bin(n))-2), end=', ')