%I #20 Dec 02 2017 02:34:28
%S 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,
%T 11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,
%U 12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13
%N Code word lengths for non-redundant MML code for positive integers.
%C 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
%H Charles R Greathouse IV, <a href="/A072464/b072464.txt">Table of n, a(n) for n = 1..10000</a>
%H Lloyd Allison, <a href="http://users.monash.edu/~lloyd/tildeMML/Discrete/Integers/">Integer Distribution</a>.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Elias_omega_coding">Elias omega coding</a>
%e Code words: 1, 010, 011, 000100, 000101, 000110, 000111, ...
%o (PARI) a(n) = local(l); if( n<2, n>0, l = length( binary(n)); l + a(l-1))
%Y Cf. A147814, A147764, A255308 (first differences), A292046 (list of distinct values).
%K nonn,easy
%O 1,2
%A _Michael Somos_, Jun 19 2002