Sums of triangular numbers and \(t\)-core partitions (Q2880105)

In 1996, \textit{A. Granville} and \textit{K. Ono} [``Defect zero \(p\)-blocks for finite simple groups'', Trans. Am. Math. Soc. 348, No. 1, 331--347 (1996; Zbl 0855.20007)] gave a positive answer to the \(t\)-core partition conjecture, which states that every natural number has a \(t\)-core partition, for every integer \(t\geq 4\). In the paper under review, the author gives a refinement of this result by showing that for every \(n\geq g\) there are at least \(g\) partitions of \(n\) which are \(tg\)-core partitions but not \(g\)-core partitions, unless \(t=g=2\) and \(n=4\) or \(n=10\). The analysis of the case \(t=g=2\) leads the author to the determination of the number of solutions of the equation NEWLINE\[NEWLINET_x+2\left(T_y+T_z\right)=n,NEWLINE\]NEWLINE for integers \(x,y,z\), where each \(T_i\) is the triangular number \(\binom{i+1}{2}\).