A241235 a(n) = number of times n appears in A006949.

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

Offset

1,1

Comments

Is this (with an exception at n=1) the same as A135560? - R. J. Mathar, Apr 26 2014

The Bodini-Genitrini-Nurligareev paper shows this sequence to be A135560 beginning with a(1) = 3 instead of A135560(1) = 2. - Michael De Vlieger, Mar 28 2026

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Olivier Bodini, Antoine Genitrini, and Khaydar Nurligareev, Growing binary trees, ResearchGate (2026). See pp. 5 (Prop. 3.2), 11 (Appendix A).

Mathematica

MapAt[# + 1 &, Table[t = IntegerExponent[n, 2]; t + Boole[n == 2^t] + 1, {n, 120}], 1] (* Michael De Vlieger, Mar 28 2026 *)

Prog

(Haskell)
a241235 n = a241235_list !! (n-1)
a241235_list = map length $ group a006949_list

Crossrefs

Cf. A051135, A135560.

Sequence in context: A331901 A306148 A106836 * A125607 A137876 A016604

Adjacent sequences: A241232 A241233 A241234 * A241236 A241237 A241238

Keyword

nonn

Author

Reinhard Zumkeller, Apr 17 2014

Status

approved