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 A326845 #5 Jul 29 2019 13:55:13
%S A326845 0,1,4,2,9,6,16,3,8,12,25,8,36,20,15,4,49,10,64,15,24,30,81,10,18,42,
%T A326845 12,24,100,18,121,5,35,56,28,12,144,72,48,18,169,28,196,35,21,90,225,
%U A326845 12,32,21,63,48,256,14,40,28,80,110,289,21,324,132,32,6,54,40
%N A326845 Sum times maximum of the integer partition with Heinz number n.
%C A326845 The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
%F A326845 a(n) = A056239(n) * A061395(n).
%t A326845 Table[If[n==1,0,With[{y=Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]},Total[y]*Max[y]]],{n,100}]
%Y A326845 Cf. A056239, A061395, A106529, A112798, A316413, A326836, A326844, A326846.
%K A326845 nonn
%O A326845 1,3
%A A326845 _Gus Wiseman_, Jul 26 2019