A175328 a(n) is the number of terms in row n of irregular table A175327. For n >= 1, a(n) = number of runs (of both 0's and 1's) in the binary representation of A175326(n).

0, 1, 2, 1, 2, 3, 2, 1, 2, 4, 2, 2, 1, 2, 5, 2, 2, 2, 1, 2, 3, 6, 2, 3, 2, 3, 2, 2, 1, 2, 7, 2, 2, 2, 2, 2, 1, 2, 8, 2, 4, 2, 2, 2, 2, 2, 1, 2, 3, 9, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 1, 2, 4, 10, 2, 5, 2, 2, 4, 2, 2, 2, 2, 2, 1, 2, 11, 2, 2, 2, 2, 2, 2, 2, 2

Offset

0,3

Comments

a(0) = 0 is the number of terms in the empty list.

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A175326, A175327.

Sequence in context: A278603 A248218 A182110 * A338776 A345933 A198325

Adjacent sequences: A175325 A175326 A175327 * A175329 A175330 A175331

Keyword

base,nonn

Author

Leroy Quet, Apr 07 2010

Extensions

More terms from Rémy Sigrist, Nov 08 2018

Status

approved