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 A308771 #9 Jun 17 2022 13:32:22
%S A308771 0,0,0,0,0,0,0,0,2,2,2,4,5,4,7,4,8,6,10,8,18,6,18,10,21,10,28,10,38,
%T A308771 14,34,14,47,12,51,18,55,16,68,18,81,20,73,22,105,20,110,24,113,26,
%U A308771 136,24,161,30,147,32,187,28,200,34,204,32,237,32,262,38,246
%N A308771 Sum of the smallest parts of the partitions of n into 4 prime parts.
%H A308771 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308771 a(n) = Sum_{k=1..floor(n/4)} Sum_{j=k..floor((n-k)/3)} Sum_{i=j..floor((n-j-k)/2)} c(k) * c(j) * c(i) * c(n-i-j-k) * k, where c = A010051.
%F A308771 a(n) = A308809(n) - A308772(n) - A308773(n) - A308774(n).
%t A308771 Table[Sum[Sum[Sum[k (PrimePi[k] - PrimePi[k - 1])*(PrimePi[j] - PrimePi[j - 1]) (PrimePi[i] - PrimePi[i - 1]) (PrimePi[n - i - j - k] - PrimePi[n - i - j - k - 1]), {i, j, Floor[(n - j - k)/2]}], {j, k, Floor[(n - k)/3]}], {k, Floor[n/4]}], {n, 0, 100}]
%Y A308771 Cf. A010051, A259194, A308772, A308773, A308774, A308809.
%K A308771 nonn
%O A308771 0,9
%A A308771 _Wesley Ivan Hurt_, Jun 23 2019