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.

A180292 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-2.

Original entry on oeis.org

1, 18, 50, 90, 147, 224, 324, 450, 605, 792, 1014, 1274, 1575, 1920, 2312, 2754, 3249, 3800, 4410, 5082, 5819, 6624, 7500, 8450, 9477, 10584, 11774, 13050, 14415, 15872, 17424, 19074, 20825, 22680, 24642, 26714, 28899, 31200, 33620, 36162, 38829, 41624
Offset: 3

Views

Author

R. H. Hardin, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010

Keywords

Crossrefs

(n-2)nd entry in rows of A180281.

Formula

Empirical: a(n)=n*binomial(n,n-2) for n>4.