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 A308767 #9 Jun 25 2019 03:59:50
%S A308767 0,0,0,0,1,1,2,2,4,4,6,6,8,8,11,11,15,15,19,20,25,24,30,30,37,36,44,
%T A308767 43,53,52,60,60,71,69,80,80,93,92,106,104,122,119,135,134,155,152,172,
%U A308767 172,194,192,213,212,239,234,257,256,290,281,308,305,343,336
%N A308767 Number of partitions of n into 4 squarefree parts.
%H A308767 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308767 a(n) = Sum_{k=1..floor(n/4)} Sum_{j=k..floor((n-k)/3)} Sum_{i=j..floor((n-j-k)/2)} mu(k)^2 * mu(j)^2 * mu(i)^2 * mu(n-i-j-k)^2, where mu is the Möbius function (A008683).
%F A308767 a(n) = A308783(n)/n.
%t A308767 Table[Sum[Sum[Sum[MoebiusMu[k]^2*MoebiusMu[j]^2*MoebiusMu[i]^2*MoebiusMu[n - i - j - k]^2, {i, j, Floor[(n - j - k)/2]}], {j, k, Floor[(n - k)/3]}], {k, Floor[n/4]}], {n, 0, 100}]
%Y A308767 Cf. A008683, A308783.
%K A308767 nonn
%O A308767 0,7
%A A308767 _Wesley Ivan Hurt_, Jun 23 2019