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.
%I A180299 #6 Jun 02 2025 03:03:38 %S A180299 1,25652,461175,1740024,3907995,7391475,13058840,22225256,36773397, %T A180299 59366450,93736500,145044900,220330110,329064450,483841800,701220000, %U A180299 1002744600,1416183912,1977008880,2730155120,3732108600,5053360840 %N A180299 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-9. %H A180299 R. H. Hardin, <a href="/A180299/b180299.txt">Table of n, a(n) for n=10..59</a> %F A180299 Empirical: a(n)=n*binomial(n+7,n-2) for n>18 %Y A180299 n-9th entry in rows of A180281 %K A180299 nonn %O A180299 10,2 %A A180299 _R. H. Hardin_, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010