A072464 Code word lengths for non-redundant MML code for positive integers.

1, 3, 3, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13

Offset: 1

Author

Michael Somos, Jun 19 2002

Keywords

• nonn
• easy

Comments

Also the number of bits needed to write the universal code for an Elias omega coding. This seems to differ (by 1 bit) from the Elias omega coding used in A147814 and A147764. - Charles R Greathouse IV, Mar 26 2012

Examples

			Code words: 1, 010, 011, 000100, 000101, 000110, 000111, ...
		

Links

• Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
• Lloyd Allison, Integer Distribution.
• Wikipedia, Elias omega coding

Crossrefs

Cf. A147814, A147764, A255308 (first differences), A292046 (list of distinct values).

Programs

PARI

a(n) = local(l); if( n<2, n>0, l = length( binary(n)); l + a(l-1))