

A072464


Code word lengths for nonredundant MML code for positive integers.


3



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


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


LINKS

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


EXAMPLE

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


PROG

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


CROSSREFS

Cf. A147814, A147764, A255308 (first differences), A292046 (list of distinct values).
Sequence in context: A131077 A175520 A271668 * A262871 A160745 A105676
Adjacent sequences: A072461 A072462 A072463 * A072465 A072466 A072467


KEYWORD

nonn,easy


AUTHOR

Michael Somos, Jun 19 2002


STATUS

approved



