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!)
A308996 Sum of the third largest parts in the partitions of n into 8 parts. 8
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 7, 11, 19, 28, 44, 63, 92, 128, 183, 246, 337, 448, 597, 774, 1012, 1291, 1656, 2085, 2627, 3264, 4064, 4987, 6127, 7450, 9055, 10901, 13126, 15669, 18701, 22157, 26228, 30858, 36279, 42397, 49509, 57527, 66773, 77148 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,11
LINKS
FORMULA
a(n) = Sum_{p=1..floor(n/8)} Sum_{o=p..floor((n-p)/7)} Sum_{m=o..floor((n-o-p)/6)} Sum_{l=m..floor((n-m-o-p)/5)} Sum_{k=l..floor((n-l-m-o-p)/4)} Sum_{j=k..floor((n-k-l-m-o-p)/3)} Sum_{i=j..floor((n-j-k-l-m-o-p)/2)} j.
a(n) = A308989(n) - A308990(n) - A308991(n) - A308992(n) - A308994(n) - A308995(n) - A308997(n) - A308998(n).
MATHEMATICA
Table[Total[IntegerPartitions[n, {8}][[All, 3]]], {n, 0, 50}] (* Harvey P. Dale, Jul 19 2020 *)
CROSSREFS
Sequence in context: A308871 A325546 A308931 * A326471 A326596 A170804
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jul 04 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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)