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!)
A308869 Sum of the fifth largest parts in the partitions of n into 6 parts. 6
0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 8, 13, 17, 25, 34, 48, 63, 86, 109, 143, 182, 232, 288, 363, 442, 547, 662, 804, 961, 1157, 1368, 1626, 1909, 2245, 2613, 3054, 3525, 4082, 4688, 5388, 6150, 7031, 7974, 9059, 10231, 11560, 12991, 14614, 16346, 18300, 20400 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
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)} l.
a(n) = A308867(n) - A308868(n) - A306670(n) - A306671(n) - A308872(n) - A308873(n).
MATHEMATICA
Table[Sum[Sum[Sum[Sum[Sum[l, {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
Sequence in context: A241551 A070217 A256121 * A001149 A144117 A081612
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 16:48 EDT 2024. Contains 375073 sequences. (Running on oeis4.)