OFFSET
1,2
LINKS
Mikhail Kurkov, Table of n, a(n) for n = 1..8191 (n = 1..37 from John W. Layman)
J. C. Kieffer, W. Szpankowski and E.-H. Yang, Problems on sequences: information theory and computer science interface, IEEE Trans. Inform. Theory, 50 (No. 7, 2004), 1385-1392.
EXAMPLE
The 8 strings of length 4 are 1111, 1112, 1122, 1123, 1222, 1223, 1233, 1234.
PROG
(PARI) f(n, k) = sum(j=0, k-1, 1 + log(hammingweight(n\(2^j)))\log(10));
a(n) = sum(k=0, log(n)\log(2), hammingweight(n\(2^k))*10^f(n, k)); \\ Michel Marcus, May 09 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 25 2004
EXTENSIONS
More terms from John W. Layman, Oct 07 2004
STATUS
approved