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!)
A326589 Sum of the smallest parts of the partitions of n into 10 parts. 10

%I #8 Jul 14 2019 06:31:38

%S 0,0,0,0,0,0,0,0,0,0,1,1,2,3,5,7,11,15,22,30,43,56,77,100,133,171,223,

%T 282,362,453,573,709,884,1084,1337,1626,1984,2394,2896,3468,4163,4951,

%U 5897,6972,8249,9696,11402,13330,15586,18131,21091,24417,28264,32580

%N Sum of the smallest parts of the partitions of n into 10 parts.

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

%F 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)} r.

%F a(n) = A326588(n) - A326590(n) - A326591(n) - A326592(n) - A326593(n) - A326594(n) - A326595(n) - A326596(n) - A326597(n) - A326598(n).

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

%Y Cf. A026816, A326588, A326590, A326591, A326592, A326593, A326594, A326595, A326596, A326597, A326598.

%K nonn

%O 0,13

%A _Wesley Ivan Hurt_, Jul 13 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 April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)