A364215 The number of 1's in the canonical representation of n as a sum of distinct Jacobsthal numbers (A280049).

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

Offset

1,2

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Formula

a(n) = A007953(A280049(n)).

a(n) = A000120(A003159(n)).

a(A007583(n)) = 1.

Mathematica

DigitCount[Select[Range[200], EvenQ[IntegerExponent[#, 2]] &], 2, 1]

Prog

(PARI) s(n) = if(n < 2, n > 0, n = s(n-1); until(valuation(n, 2)%2 == 0, n++); n); \\ A003159
a(n) = hammingweight(s(n));

Crossrefs

Cf. A000120, A003159, A007583, A007953, A280049.

Sequence in context: A321861 A283431 A258594 * A086520 A012265 A339765

Adjacent sequences: A364212 A364213 A364214 * A364216 A364217 A364218

Keyword

nonn,base,easy

Author

Amiram Eldar, Jul 14 2023

Status

approved