This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308872 Sum of the second largest parts in the partitions of n into 6 parts. 6
 0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 10, 15, 27, 37, 59, 82, 120, 160, 227, 293, 396, 508, 664, 832, 1068, 1314, 1650, 2012, 2477, 2980, 3628, 4314, 5178, 6111, 7250, 8477, 9975, 11566, 13483, 15543, 17970, 20577, 23646, 26907, 30712, 34785, 39469, 44472, 50217 (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)} i. a(n) = A308867(n) - A308868(n) - A308869(n) - A306670(n) - A306671(n) - A308873(n). MATHEMATICA Table[Sum[Sum[Sum[Sum[Sum[i, {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, A308868, A308869, A306670, A306671, A308873. Sequence in context: A264397 A254346 A132302 * A097513 A308932 A308997 Adjacent sequences:  A308869 A308870 A308871 * A308873 A308874 A308875 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.

Last modified August 20 19:51 EDT 2019. Contains 326155 sequences. (Running on oeis4.)