This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A072464 #20 Dec 02 2017 02:34:28 %S A072464 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 A072464 11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12, %U A072464 12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13 %N A072464 Code word lengths for non-redundant MML code for positive integers. %C A072464 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 A072464 Charles R Greathouse IV, <a href="/A072464/b072464.txt">Table of n, a(n) for n = 1..10000</a> %H A072464 Lloyd Allison, <a href="http://users.monash.edu/~lloyd/tildeMML/Discrete/Integers/">Integer Distribution</a>. %H A072464 Wikipedia, <a href="https://en.wikipedia.org/wiki/Elias_omega_coding">Elias omega coding</a> %e A072464 Code words: 1, 010, 011, 000100, 000101, 000110, 000111, ... %o A072464 (PARI) a(n) = local(l); if( n<2, n>0, l = length( binary(n)); l + a(l-1)) %Y A072464 Cf. A147814, A147764, A255308 (first differences), A292046 (list of distinct values). %K A072464 nonn,easy %O A072464 1,2 %A A072464 _Michael Somos_, Jun 19 2002