A175022 a(n) = the number of runs (those of 0 and of 1 considered together) in the binary representation of A175020(n).

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

Offset: 1

Author

Leroy Quet, Nov 03 2009

Keywords

• base
• nonn

Comments

a(n) gives the number of terms in row n of irregular tables A175023 and A175024.

Links

• Michael De Vlieger, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A175020, A175023, A175024, A175025.

Programs

Mathematica

With[{s = Array[Sort@ Map[Length, Split@ IntegerDigits[#, 2]] &, 265]}, Map[Length@ Split@ IntegerDigits[#, 2] &, Values[PositionIndex@ s][[All, 1]] ]] (* Michael De Vlieger, Sep 03 2017 *)

Extensions

Extended by Ray Chandler, Mar 11 2010