The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339549 a(n) is the product of the binary weights (A000120) of the divisors of n. 4
1, 1, 2, 1, 2, 4, 3, 1, 4, 4, 3, 8, 3, 9, 16, 1, 2, 16, 3, 8, 18, 9, 4, 16, 6, 9, 16, 27, 4, 256, 5, 1, 12, 4, 18, 64, 3, 9, 24, 16, 3, 324, 4, 27, 128, 16, 5, 32, 9, 36, 16, 27, 4, 256, 30, 81, 24, 16, 5, 4096, 5, 25, 216, 1, 12, 144, 3, 8, 24, 324, 4, 256, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Analogous to A093653 with product instead of sum.
LINKS
FORMULA
a(n) = Product_{d|n} A000120(d).
a(n) = 1 if and only if n is a power of 2 (A000079).
EXAMPLE
a(6) = 4 since the divisors of 6 are {1, 2, 3, 6}, and in binary representation {1, 10, 11, 110}. The number of 1's are {1, 1, 2, 2} and their product is 1*1*2*2 = 4.
MATHEMATICA
a[n_] := Times @@ (DigitCount[#, 2, 1] & /@ Divisors[n]); Array[a, 100]
PROG
(PARI) a(n) = vecprod(apply(hammingweight, divisors(n))); \\ Michel Marcus, Dec 08 2020
CROSSREFS
Sequence in context: A120855 A193737 A160001 * A179750 A091173 A101897
KEYWORD
nonn,base
AUTHOR
Amiram Eldar, Dec 08 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 19:14 EDT 2024. Contains 373360 sequences. (Running on oeis4.)