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 A280316 #12 Jun 19 2019 05:25:47
%S A280316 2,18,44,124,108,372,398,886,888,1560,1642,2778,2098,3440,2810,5618,
%T A280316 5350,9766,6934,12382,9744,17448,11112,20440,12728,24050,19508,26610,
%U A280316 25270,36108,28950,41020,31974,56038,42490,74484,51668,77210,52810,87970,57074,105804,68972
%N A280316 Sum of squares of parts of the partitions of 2n into two squarefree parts.
%H A280316 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A280316 a(n) = Sum_{i=1..n} (i^2 + (2*n-i)^2) * mu(i)^2 * mu(2*n-i)^2, where mu is the Möbius function (A008683).
%F A280316 a(n) = A280320(n) + A280322(n).
%p A280316 with(numtheory): A280316:=n->add((i^2+(2*n-i)^2) * mobius(i)^2 * mobius(2*n-i)^2, i=1..n): seq(A280316(n), n=1..100);
%Y A280316 Cf. A008683, A280226, A280320, A280322.
%K A280316 nonn,easy
%O A280316 1,1
%A A280316 _Wesley Ivan Hurt_, Dec 31 2016