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 A369309 #9 Jan 19 2024 16:56:26
%S A369309 1,0,0,2,0,0,0,2,2,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,4,0,0,
%T A369309 0,4,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,
%U A369309 0,0,0,4,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0
%N A369309 The number of powerful divisors d of n such that n/d is also powerful.
%H A369309 Amiram Eldar, <a href="/A369309/b369309.txt">Table of n, a(n) for n = 1..10000</a>
%F A369309 Multiplicative with a(p^2) = 2 and a(p^e) = e-1 if e != 2.
%F A369309 a(n) > 0 if and only if n is powerful (A001694).
%F A369309 Dirichlet g.f.: (zeta(2*s)*zeta(3*s)/zeta(6*s))^2.
%F A369309 Sum_{k=1..n} a(k) ~ (zeta(3/2)^2/(2*zeta(3)^2)) * sqrt(n) * (log(n) + 4*gamma - 2 + 6*zeta'(3/2)/zeta(3/2) - 12*zeta'(3)/zeta(3)), where gamma is Euler's constant (A001620).
%t A369309 f[p_,e_] := If[e == 2, 2, e-1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A369309 (PARI) a(n) = vecprod(apply(x -> if(x==2, 2, x-1), factor(n)[,2]));
%Y A369309 Cf. A001694, A005361, A369310.
%Y A369309 Cf. A001620, A002117, A078434, A244115.
%K A369309 nonn,easy,mult
%O A369309 1,4
%A A369309 _Amiram Eldar_, Jan 19 2024