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 A071325 #26 Oct 06 2024 09:13:38
%S A071325 0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,2,0,1,0,1,0,0,0,1,1,0,1,1,0,0,0,2,0,0,
%T A071325 0,3,0,0,0,1,0,0,0,1,1,0,0,2,1,1,0,1,0,1,0,1,0,0,0,1,0,0,1,3,0,0,0,1,
%U A071325 0,0,0,3,0,0,1,1,0,0,0,2,2,0,0,1,0,0,0,1,0,1,0,1,0
%N A071325 Number of squares > 1 dividing n.
%H A071325 Antti Karttunen, <a href="/A071325/b071325.txt">Table of n, a(n) for n = 1..1000</a>
%H A071325 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A071325 a(n) = A046951(n) - 1.
%F A071325 A057427(a(n)) = 1 - A008966(n).
%F A071325 G.f.: Sum_{k>=2} x^(k^2)/(1 - x^(k^2)). - _Ilya Gutkovskiy_, Jan 04 2017
%F A071325 Asymptotic mean: lim_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi^2/6 - 1. - _Amiram Eldar_, Sep 25 2022
%t A071325 a[n_] := DivisorSum[n, Boole[#>1 && IntegerQ[Sqrt[#]]]&]
%t A071325 Array[a, 100] (* _Jean-François Alcover_, Dec 10 2021 *)
%o A071325 (PARI) a(n) = sumdiv(n, d, issquare(d) && (d>1)); \\ _Michel Marcus_, Jan 04 2017
%o A071325 (Python)
%o A071325 from math import prod
%o A071325 from sympy import factorint
%o A071325 def A071325(n): return prod((e>>1)+1 for e in factorint(n).values())-1 # _Chai Wah Wu_, Oct 06 2024
%Y A071325 Cf. A008966, A013661, A046951, A057427.
%K A071325 nonn
%O A071325 1,16
%A A071325 _Reinhard Zumkeller_, May 18 2002