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!)
A326473 Sum of the largest parts of the partitions of n into 9 parts. 9

%I #5 Jul 10 2019 07:38:44

%S 0,0,0,0,0,0,0,0,0,1,2,5,9,17,27,46,69,108,158,232,326,464,633,869,

%T 1164,1557,2041,2678,3449,4442,5645,7153,8967,11224,13903,17187,21081,

%U 25785,31321,37963,45714,54930,65650,78263,92860,109946,129586,152417,178584

%N Sum of the largest parts of the partitions of n into 9 parts.

%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>

%F a(n) = Sum_{q=1..floor(n/9)} Sum_{p=q..floor((n-q)/8)} Sum_{o=p..floor((n-p-q)/7)} Sum_{m=o..floor((n-o-p-q)/6)} Sum_{l=m..floor((n-m-o-p-q)/5)} Sum_{k=l..floor((n-l-m-o-p-q)/4)} Sum_{j=k..floor((n-k-l-m-o-p-q)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p-q)/2)} (n-i-j-k-l-m-o-p-q).

%F a(n) = A326464(n) - A326465(n) - A326466(n) - A326467(n) - A326468(n) - A326469(n) - A326470(n) - A326471(n) - A326472(n).

%t Table[Sum[Sum[Sum[Sum[Sum[Sum[Sum[Sum[(n-i-j-k-l-m-o-p-q), {i, j, Floor[(n - j - k - l - m - o - p - q)/2]}], {j, k, Floor[(n - k - l - m - o - p - q)/3]}], {k, l, Floor[(n - l - m - o - p - q)/4]}], {l, m, Floor[(n - m - o - p - q)/5]}], {m, o, Floor[(n - o - p - q)/6]}], {o, p, Floor[(n - p - q)/7]}], {p, q, Floor[(n - q)/8]}], {q, Floor[n/9]}], {n, 0, 50}]

%Y Cf. A026815, A326464, A326465, A326466, A326467, A326468, A326469, A326470, A326471, A326472.

%K nonn

%O 0,11

%A _Wesley Ivan Hurt_, Jul 10 2019

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)