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!)
A343124 Total number of partitions of k*n into 3 parts for k = 1..n. 0
0, 1, 11, 39, 114, 273, 571, 1086, 1925, 3206, 5101, 7800, 11533, 16575, 23252, 31911, 42987, 56943, 74304, 95662, 121682, 153060, 190614, 235200, 287758, 349317, 421001, 503975, 599560, 709125, 834145, 976206, 1137011, 1318314, 1522059, 1750248, 2005011, 2288611 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = Sum_{k=1..n} Sum_{j=1..floor(k*n/3)} Sum_{i=j..floor((k*n-j)/2)} 1.
MATHEMATICA
Table[Sum[Sum[Sum[1, {i, j, Floor[(k*n - j)/2]}], {j, Floor[k*n/3]}], {k, n}], {n, 50}]
CROSSREFS
Cf. A069905.
Sequence in context: A004188 A347477 A163634 * A336901 A173373 A127867
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Apr 05 2021
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 August 16 16:43 EDT 2024. Contains 375177 sequences. (Running on oeis4.)