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 A258359 #7 Dec 11 2020 07:29:50 %S A258359 210,330,852,1826,4207,6595,13548,21479,38905,59000,95953,142843, %T A258359 231431,324152,487361,683227,1003028,1347337,1907811,2541970,3526314, %U A258359 4597020,6194948,7969172,10618000,13401580,17424498,21875750,28102737,34685941,43856482,53791587 %N A258359 Sum over all partitions lambda of n into 4 distinct parts of Product_{i:lambda} prime(i). %H A258359 Alois P. Heinz, <a href="/A258359/b258359.txt">Table of n, a(n) for n = 10..1000</a> %p A258359 g:= proc(n, i) option remember; convert(series(`if`(n=0, 1, %p A258359 `if`(i<1, 0, add(g(n-i*j, i-1)*(ithprime(i)*x)^j %p A258359 , j=0..min(1, n/i)))), x, 5), polynom) %p A258359 end: %p A258359 a:= n-> coeff(g(n$2), x, 4): %p A258359 seq(a(n), n=10..60); %t A258359 g[n_, i_] := g[n, i] = If[n == 0, 1, If[i < 1, 0, Sum[g[n - i j, i - 1] (Prime[i] x)^j, {j, 0, Min[1, n/i]}]]]; %t A258359 a[n_] := Coefficient[g[n, n], x, 4]; %t A258359 a /@ Range[10, 60] (* _Jean-François Alcover_, Dec 11 2020, after _Alois P. Heinz_ *) %Y A258359 Column k=4 of A258323. %Y A258359 Cf. A000040. %K A258359 nonn %O A258359 10,1 %A A258359 _Alois P. Heinz_, May 27 2015