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 A326542 #9 May 07 2022 20:59:11
%S A326542 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,2,4,4,6,8,8,11,15,15,19,22,
%T A326542 24,26,34,36,44,47,53,59,73,71,87,93,109,109,138,128,163,157,190,190,
%U A326542 238,210,277,262,325,300,387,344,457,399,515,464,617,515
%N A326542 Sum of the eighth largest parts of the partitions of n into 9 primes.
%H A326542 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A326542 a(n) = Sum_{q=1..floor(n/9)} Sum_{p=q..floor((n-q)/8)} Sum_{o=p..floor((n-p-q)/7)} Sum_{m=o..floor((n-o-p-q)/6)} Sum_{l=m..floor((n-m-o-p-q)/5)} Sum_{k=l..floor((n-l-m-o-p-q)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q)/2)} c(q) * c(p) * c(o) * c(m) * c(l) * c(k) * c(j) * c(i) * c(n-i-j-k-l-m-o-p-q) * p, where c = A010051.
%F A326542 a(n) = A326540(n) - A326541(n) - A326543(n) - A326544(n) - A326545(n) - A326546(n) - A326547(n) - A326548(n) - A326549(n).
%t A326542 Table[Total[Select[IntegerPartitions[n,{9}],AllTrue[#,PrimeQ]&][[All,8]]],{n,0,70}] (* _Harvey P. Dale_, May 03 2022 *)
%Y A326542 Cf. A010051, A259200, A326540, A326541, A326543, A326544, A326545, A326546, A326547, A326548, A326549.
%K A326542 nonn
%O A326542 0,19
%A A326542 _Wesley Ivan Hurt_, Jul 13 2019