Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 May 10 2022 14:24:16
%S 1,2,2,3,2,4,2,3,3,4,2,6,2,4,4,4,2,6,2,6,4,4,2,6,3,4,3,6,2,8,2,4,4,4,
%T 4,9,2,4,4,6,2,8,2,6,6,4,2,8,3,6,4,6,2,6,4,6,4,4,2,12,2,4,6,4,4,8,2,6,
%U 4,8,2,9,2,4,6,6,4,8,2,8,4,4,2,12,4,4,4
%N a(n) is the number of divisors of n whose exponents in their prime factorizations are all powers of 2 (A138302).
%C First differs from A049599 and A282446 at n=32.
%H Amiram Eldar, <a href="/A353898/b353898.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = floor(log_2(e)) + 2.
%F a(n) > 1 for n > 1 and a(n) = 2 if and only if n is a prime.
%F a(n) = A000005(n) if and only if n is cubefree (A004709).
%e The divisors of 8 are 1, 2 = 2^1, 4 = 2^2 and 8 = 2^3. 3 of these divisors, 1, 2 and 4, are in A138302. Therefore, a(8) = 3.
%t f[p_, e_] := Floor[Log2[e]] + 2; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%Y Cf. A000005, A004709, A049599, A138302, A282446, A353897.
%Y Similar sequences: A034444, A048105, A286324, A049419.
%K nonn,mult
%O 1,2
%A _Amiram Eldar_, May 10 2022