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!)
A326590 Sum of the ninth largest parts of the partitions of n into 10 parts. 10
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 22, 31, 44, 58, 80, 105, 140, 182, 238, 304, 393, 496, 630, 787, 986, 1219, 1512, 1853, 2273, 2765, 3362, 4055, 4894, 5860, 7016, 8351, 9931, 11746, 13885, 16330, 19188, 22452, 26242, 30549, 35531 (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)} q.
a(n) = A326588(n) - A326589(n) - A326591(n) - A326592(n) - A326593(n) - A326594(n) - A326595(n) - A326596(n) - A326597(n) - A326598(n).
MATHEMATICA
Table[Total[IntegerPartitions[n, {10}][[;; , 9]]], {n, 0, 60}] (* Harvey P. Dale, Mar 18 2023 *)
CROSSREFS
Sequence in context: A326465 A101977 A024793 * A116601 A218024 A236102
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 24 08:48 EDT 2024. Contains 371930 sequences. (Running on oeis4.)