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.
%I A369760 #8 Feb 03 2024 10:16:28
%S A369760 1,2,2,3,2,4,2,5,3,4,2,6,2,4,4,5,2,6,2,6,4,4,2,10,3,4,5,6,2,8,2,9,4,4,
%T A369760 4,9,2,4,4,10,2,8,2,6,6,4,2,10,3,6,4,6,2,10,4,10,4,4,2,12,2,4,6,9,4,8,
%U A369760 2,6,4,8,2,15,2,4,6,6,4,8,2,10,5,4,2,12
%N A369760 The number of divisors of the smallest multiple of n whose prime factorization exponents are all powers of 2.
%H A369760 Amiram Eldar, <a href="/A369760/b369760.txt">Table of n, a(n) for n = 1..10000</a>
%F A369760 a(n) = A000005(A356194(n)).
%F A369760 Multiplicative with a(p^e) = 2^ceiling(log_2(e)) + 1.
%F A369760 a(n) >= A000005(n), with equality if and only if n is in A138302.
%t A369760 f[p_, e_] := 2^Ceiling[Log2[e]] + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A369760 (PARI) s(n) = {my(e=logint(n, 2)); if(n == 2^e, n, 2^(e+1))};
%o A369760 a(n) = vecprod(apply(x -> s(x) + 1, factor(n)[, 2]));
%Y A369760 Cf. A000005, A138302, A353897, A356194, A369761, A369762.
%K A369760 nonn,easy,mult
%O A369760 1,2
%A A369760 _Amiram Eldar_, Jan 31 2024