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 A372330 #6 Apr 28 2024 11:35:14
%S A372330 1,2,2,4,2,4,2,4,4,4,2,8,2,4,4,8,2,8,2,8,4,4,2,8,4,4,4,8,2,8,2,8,4,4,
%T A372330 4,16,2,4,4,8,2,8,2,8,8,4,2,16,4,8,4,8,2,8,4,8,4,4,2,16,2,4,8,8,4,8,2,
%U A372330 8,4,8,2,16,2,4,8,8,4,8,2,16,8,4,2,16,4
%N A372330 The number of divisors of the smallest multiple of n whose number of divisors is a power of 2 (A036537).
%C A372330 Also, the number of infinitary divisors of the smallest multiple of n whose number of divisors is a power of 2.
%H A372330 Amiram Eldar, <a href="/A372330/b372330.txt">Table of n, a(n) for n = 1..10000</a>
%F A372330 a(n) = A000005(A372329(n)).
%F A372330 a(n) = A037445(A372329(n)).
%F A372330 Multiplicative with a(p^e) = 2^ceiling(log_2(e+1)).
%t A372330 f[p_, e_] := 2^Ceiling[Log2[e + 1]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A372330 (PARI) s(n) = {my(e=logint(n + 1, 2)); if(n + 1 == 2^e, n + 1, 2^(e+1))};
%o A372330 a(n) = {my(f=factor(n)); prod(i=1, #f~, s(f[i, 2]))};
%Y A372330 Cf. A000005, A036537, A037445, A372329.
%K A372330 nonn,easy,mult
%O A372330 1,2
%A A372330 _Amiram Eldar_, Apr 28 2024