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 A294104 #17 Jun 13 2020 00:50:06
%S A294104 0,0,1,2,1,4,8,12,8,4,10,24,22,20,29,54,33,40,31,72,37,70,54,114,68,
%T A294104 62,74,116,97,62,114,182,136,126,147,292,175,134,180,330,214,182,227,
%U A294104 412,273,190,209,460,343,202,156,468,392,380,156,518,394,490,303
%N A294104 Sum of the differences of the larger and smaller parts in the partitions of n into two squarefree parts or two nonsquarefree parts.
%H A294104 Robert Israel, <a href="/A294104/b294104.txt">Table of n, a(n) for n = 1..10000</a>
%H A294104 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A294104 a(n) = Sum_{i=1..floor(n/2)} (n - 2i) * [A008966(i) = A008966(n-i)], where [] is the Iverson bracket.
%p A294104 f:= n -> add(n-2*i, i = select(t -> numtheory:-issqrfree(t)=numtheory:-issqrfree(n-t), [$1..n/2])):
%p A294104 map(f, [$1..100]); # _Robert Israel_, Jun 12 2020
%t A294104 Table[Sum[(n - 2 k) KroneckerDelta[MoebiusMu[k]^2, MoebiusMu[ n - k]^2], {k, Floor[n/2]}], {n, 80}]
%Y A294104 Cf. A008966, A294100.
%K A294104 nonn,easy,look
%O A294104 1,4
%A A294104 _Wesley Ivan Hurt_, Oct 22 2017