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.

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

Original entry on oeis.org

1, 73788, 1645215, 6838832, 16011905, 30931296, 55439448, 95585220, 160286166, 262462010, 420630210, 660990330, 1020099795, 1548293760, 2314026000, 3409331640, 4956643692, 7117231968, 10101573944, 14182012680, 19708107276
Offset: 11

Views

Author

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

Keywords

Crossrefs

n-10th entry in rows of A180281.

Formula

Empirical: a(n)=n*binomial(n+8,n-2) for n>20.