A386249 a(n) is the Hamming weight of A161792(n).

1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 6, 1, 1, 2, 1, 1, 2, 1, 1, 2, 6, 1, 1, 2, 1, 1, 2, 1, 1, 2, 6, 1, 14, 1, 2, 15, 1, 1, 2, 1, 1, 2, 6, 1, 1, 2, 1, 1, 2, 1, 1, 2, 6, 1, 1, 2, 1, 14, 1, 2, 1, 15, 1, 2, 6, 1, 1, 2, 1, 1, 2, 1, 19, 1, 2, 6, 1, 1, 2, 1, 1, 2

Offset

1,5

Comments

All terms appear infinitely many times: for any n > 0, A161792(n)*2^a(n) also belongs to A161792, say it equals A161792(m) for some m > n, so a(n) = a(m), and we can find as many other occurrences of a(n) as we want.

Links

Michael S. Branicky, Table of n, a(n) for n = 1..275 (using b-file at A161792)

Formula

a(n) = A000120(A161792(n)).

Example

a(35) = A000120(2985984) = 6.

Prog

(PARI) { for (n = 1, oo, if (ispower(n, h = hammingweight(n)), print1 (h", ")); ); }

Crossrefs

Cf. A000120, A161792, A325454, A386248.

Sequence in context: A161046 A330556 A341674 * A363922 A230404 A378725

Adjacent sequences: A386246 A386247 A386248 * A386250 A386251 A386252

Keyword

nonn,base

Author

Rémy Sigrist, Jul 16 2025

Extensions

a(65) and beyond from Michael S. Branicky, Jul 21 2025 using A161792

Status

approved