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

%I #9 Sep 12 2021 21:25:00

%S 0,0,0,0,0,0,0,0,0,1,1,2,3,5,7,11,15,22,31,42,56,76,99,130,168,216,

%T 274,349,435,544,674,831,1017,1244,1507,1823,2194,2629,3136,3734,4420,

%U 5223,6148,7215,8438,9851,11453,13292,15382,17758,20447,23502,26935

%N Sum of the smallest 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)} q.

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

%t Table[Total[Last/@IntegerPartitions[n,{9}]],{n,0,60}] (* _Harvey P. Dale_, Sep 13 2019 *)

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

%K nonn

%O 0,12

%A _Wesley Ivan Hurt_, Jul 07 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 May 8 12:24 EDT 2024. Contains 372333 sequences. (Running on oeis4.)