cp's OEIS Frontend

A308873 Sum of the largest parts in the partitions of n into 6 parts.

%I A308873 #7 Jun 29 2019 17:35:20
%S A308873 0,0,0,0,0,0,1,2,5,9,17,27,46,67,103,146,210,285,396,520,694,896,1162,
%T A308873 1466,1865,2310,2881,3525,4321,5215,6317,7535,9011,10653,12603,14761,
%U A308873 17316,20113,23390,26990,31146,35698,40939,46632,53139,60221,68236,76931
%N A308873 Sum of the largest parts in the partitions of n into 6 parts.
%H A308873 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A308873 a(n) = Sum_{m=1..floor(n/6)} Sum_{l=m..floor((n-m)/5)} Sum_{k=l..floor((n-l-m)/4)} Sum_{j=k..floor((n-k-l-m)/3)} Sum_{i=j..floor((n-j-k-l-m)/2)} (n-i-j-k-l-m).
%F A308873 a(n) = A308867(n) - A308868(n) - A308869(n) - A306670(n) - A306671(n) - A308872(n).
%t A308873 Table[Sum[Sum[Sum[Sum[Sum[(n - i - j - k - l - m), {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 50}]
%Y A308873 Cf. A238340, A308867, A308868, A308869, A306670, A306671, A308872.
%K A308873 nonn
%O A308873 0,8
%A A308873 _Wesley Ivan Hurt_, Jun 29 2019