A093663 Row sums of lower triangular matrix A093662.

1, 2, 2, 5, 2, 5, 5, 17, 2, 5, 5, 17, 5, 17, 17, 86, 2, 5, 5, 17, 5, 17, 17, 86, 5, 17, 17, 86, 17, 86, 86, 698, 2, 5, 5, 17, 5, 17, 17, 86, 5, 17, 17, 86, 17, 86, 86, 698, 5, 17, 17, 86, 17, 86, 86, 698, 17, 86, 86, 698, 86, 698, 698, 9551

Offset

1,2

Comments

a(n) equals the number of sequences of length A000120(n-1) that satisfy an ordering restriction (cf. A016121), where A000120(n-1) is the number of 1's in the binary expansion of n-1.

Links

Table of n, a(n) for n=1..64.

Formula

a(2^n) = A016121(n) for n>=0. a(2^n+2^m) = a(2^(m+1)) for n>m>=0.

a(n) = A016121(A000120(n-1)) for n>=1.

Crossrefs

Cf. A016121, A093662, A093664.

Cf. A000120.

Sequence in context: A101910 A162784 A093660 * A319895 A323504 A011143

Adjacent sequences: A093660 A093661 A093662 * A093664 A093665 A093666

Keyword

nonn

Author

Paul D. Hanna, Apr 08 2004

Status

approved