A326598 Sum of the largest parts of the partitions of n into 10 parts.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 5, 9, 17, 27, 46, 69, 108, 158, 234, 329, 471, 645, 891, 1198, 1614, 2125, 2808, 3637, 4718, 6029, 7699, 9709, 12243, 15265, 19013, 23473, 28933, 35381, 43211, 52396, 63436, 76343, 91710, 109580, 130720, 155171, 183884

Offset: 0

Author

Wesley Ivan Hurt, Jul 13 2019

Keywords

• nonn

Links

• Index entries for sequences related to partitions

Crossrefs

Cf. A026816, A326588, A326589, A326590, A326591, A326592, A326593, A326594, A326595, A326596, A326597.

Programs

Mathematica

Table[Total[IntegerPartitions[n,{10}][[;;,1]]],{n,0,50}] (* Harvey P. Dale, May 02 2025 *)

Formula

a(n) = Sum_{r=1..floor(n/10)} Sum_{q=r..floor((n-r)/9)} Sum_{p=q..floor((n-q-r)/8)} Sum_{o=p..floor((n-p-q-r)/7)} Sum_{m=o..floor((n-o-p-q-r)/6)} Sum_{l=m..floor((n-m-o-p-q-r)/5)} Sum_{k=l..floor((n-l-m-o-p-q-r)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q-r)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q-r)/2)} (n-i-j-k-l-m-o-p-q-r).

a(n) = A326588(n) - A326589(n) - A326590(n) - A326591(n) - A326592(n) - A326593(n) - A326594(n) - A326595(n) - A326596(n) - A326597(n).