A325454 -id:A325454 - cp's OEIS frontend

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

Rémy Sigrist, Jul 16 2025

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.

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

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

Cf. A000120, A161792, A325454, A386248.

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

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

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

A360075 a(n) is the product of the digits of A007602(n), the n-th Zuckerman number.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 5, 8, 18, 1, 2, 5, 16, 6, 15, 16, 35, 4, 12, 16, 6, 15, 96, 24, 12, 48, 84, 105, 48, 1, 2, 3, 5, 6, 3, 42, 32, 63, 4, 108, 3, 18, 48, 24, 175, 35, 4, 32, 24, 108, 3, 18, 144, 21, 252, 18, 135, 8, 64, 96, 96, 288, 108, 14, 63

Offset: 1

Rémy Sigrist, Jan 24 2023

Zuckerman numbers (A007602) correspond to numbers divisible by the product of their digits.

			For n = 1515:
- A007602(1515) = 11834112,
- so a(1515) = 1*1*8*3*4*1*1*2 = 192.

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

Cf. A007602, A007954, A051801, A288069, A325454.

{ for (n=1, 7119, p=vecprod(digits(n)); if (p && n%p==0, print1 (p", "))) }

a(n) = A007954(A007602(n)).
a(n) = A051801(A007602(n)).
a(n) * A288069(n) = A007602(n).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions