login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308868 Sum of the smallest parts in the partitions of n into 6 parts. 6

%I #8 Jun 29 2019 17:06:18

%S 0,0,0,0,0,0,1,1,2,3,5,7,12,15,22,29,40,51,70,86,112,139,176,214,269,

%T 321,394,470,567,668,801,933,1103,1281,1498,1725,2007,2293,2643,3010,

%U 3443,3897,4439,4995,5652,6341,7135,7967,8933,9930,11079,12283,13645

%N Sum of the smallest parts in the partitions of n into 6 parts.

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = 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)} m.

%F a(n) = A308867(n) - A308869(n) - A306670(n) - A306671(n) - A308872(n) - A308873(n).

%t Table[Sum[Sum[Sum[Sum[Sum[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 Cf. A238340, A308867, A308869, A306670, A306671, A308872, A308873.

%K nonn

%O 0,9

%A _Wesley Ivan Hurt_, Jun 29 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)