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!)
A326597 Sum of the second largest parts of the partitions of n into 10 parts. 10
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 10, 15, 27, 39, 63, 91, 137, 190, 277, 376, 525, 704, 956, 1255, 1671, 2160, 2818, 3599, 4616, 5819, 7369, 9187, 11480, 14179, 17527, 21441, 26256, 31851, 38649, 46543, 56022, 66980, 80050, 95083, 112860, 133266 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,13
LINKS
FORMULA
a(n) = Sum_{r=1..floor(n/10)} Sum_{q=r..floor((n-r)/9)} Sum_{p=q..floor((n-q-r)/8)} Sum_{o=p..floor((n-p-q-r)/7)} Sum_{m=o..floor((n-o-p-q-r)/6)} Sum_{l=m..floor((n-m-o-p-q-r)/5)} Sum_{k=l..floor((n-l-m-o-p-q-r)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q-r)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q-r)/2)} i.
a(n) = A326588(n) - A326589(n) - A326590(n) - A326591(n) - A326592(n) - A326593(n) - A326594(n) - A326595(n) - A326596(n) - A326598(n).
MATHEMATICA
Table[Total[IntegerPartitions[n, {10}][[;; , 2]]], {n, 0, 50}] (* Harvey P. Dale, Nov 19 2023 *)
CROSSREFS
Sequence in context: A308997 A045513 A326472 * A008337 A077285 A072523
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jul 13 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 April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)