login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
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, 321, 394, 470, 567, 668, 801, 933, 1103, 1281, 1498, 1725, 2007, 2293, 2643, 3010, 3443, 3897, 4439, 4995, 5652, 6341, 7135, 7967, 8933, 9930, 11079, 12283, 13645 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

LINKS

Table of n, a(n) for n=0..52.

Index entries for sequences related to partitions

FORMULA

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.

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

MATHEMATICA

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}]

CROSSREFS

Cf. A238340, A308867, A308869, A306670, A306671, A308872, A308873.

Sequence in context: A022438 A193760 A113623 * A078912 A105930 A122622

Adjacent sequences:  A308865 A308866 A308867 * A308869 A308870 A308871

KEYWORD

nonn

AUTHOR

Wesley Ivan Hurt, Jun 29 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 12:20 EDT 2020. Contains 337318 sequences. (Running on oeis4.)