A198260 Runs of 1s in binary strings corresponding to subgroups of nimber addition.

1, 1, 2, 2, 1, 2, 2, 2, 2, 4, 3, 2, 3, 4, 2, 1, 2, 2, 2, 2, 4, 3, 2, 4, 4, 2, 2, 2, 4, 4, 4, 3, 2, 4, 4, 4, 4, 2, 4, 3, 2, 4, 4, 4, 4, 4, 8, 7, 3, 5, 6, 2, 3, 4, 4, 4, 4, 6, 5, 4, 7, 8, 2, 3, 4, 2, 1, 2, 2, 2, 2, 4, 3, 2, 4, 4, 2, 2, 2, 4, 4, 4, 3, 2, 4, 4, 4, 4, 2, 4, 3, 2, 4, 4

Offset: 0

Author

Tilman Piesk, Oct 22 2011

Keywords

• nonn

Comments

Counts the runs of consecutive ones in the binary representation of A190939. All positive integers appear in this sequence.

The first A006116(n) entries contain all integers from 1 to 2^(n-1). E.g. the first 67 entries contain all integers from 1 to 8. How often each integer appears is counted by the triangle A227961.

Links

• Tilman Piesk, Table of n, a(n) for n = 0..2824

Crossrefs

Cf. A190939 (subgroups of nimber addition interpreted as binary numbers).

Cf. A069010 (runs of 1s).

Cf. A227961 (corresponding triangle).

Formula

a(n) = A069010(A190939(n)).

Extensions

Changed offset to 0 as in A190939 by Tilman Piesk, Jan 25 2012

Significant edit by Tilman Piesk, Aug 01 2013