cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A343124 Total number of partitions of k*n into 3 parts for k = 1..n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Wesley Ivan Hurt, Apr 05 2021

Keywords

Crossrefs

Cf. A069905.

Programs

  • Mathematica
    Table[Sum[Sum[Sum[1, {i, j, Floor[(k*n - j)/2]}], {j, Floor[k*n/3]}], {k, n}], {n, 50}]

Formula

a(n) = Sum_{k=1..n} Sum_{j=1..floor(k*n/3)} Sum_{i=j..floor((k*n-j)/2)} 1.