cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A339552 Numbers k such that the product of the binary weights of the divisors of k (A339549) sets a new record.

This page as a plain text file.
%I A339552 #11 Dec 09 2020 01:15:05
%S A339552 1,3,6,12,14,15,21,28,30,42,60,84,90,120,168,180,210,252,360,420,540,
%T A339552 630,840,1080,1260,2520,3780,5040,6300,7560,10080,12600,13860,15120,
%U A339552 21420,22680,25200,27720,32760,37800,41580,42840,49140,55440,65520,75600,83160
%N A339552 Numbers k such that the product of the binary weights of the divisors of k (A339549) sets a new record.
%C A339552 Analogous to A093687 as A339549 is analogous to A093653.
%C A339552 The corresponding record values of A339549 are 1, 2, 4, 8, 9, 16, 18, 27, 256, 324, ... (see the link for more values).
%H A339552 Amiram Eldar, <a href="/A339552/b339552.txt">Table of n, a(n) for n = 1..150</a>
%H A339552 Amiram Eldar, <a href="/A339552/a339552.txt">Table of n, a(n), A339549(a(n)) for n = 1..150</a>
%t A339552 f[n_] := Times @@ (DigitCount[#, 2, 1] & /@ Divisors[n]); c=0; fm = 0; s = {}; Do[f1 = f[n]; If[f1 > fm, fm = f1; AppendTo[s, n]], {n, 1, 10000}]; s
%Y A339552 Cf. A000120, A093653, A093687, A339549.
%K A339552 nonn,base
%O A339552 1,2
%A A339552 _Amiram Eldar_, Dec 08 2020