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 A180292 #7 Apr 16 2014 00:24:59 %S A180292 1,18,50,90,147,224,324,450,605,792,1014,1274,1575,1920,2312,2754, %T A180292 3249,3800,4410,5082,5819,6624,7500,8450,9477,10584,11774,13050,14415, %U A180292 15872,17424,19074,20825,22680,24642,26714,28899,31200,33620,36162,38829,41624 %N A180292 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-2. %H A180292 R. H. Hardin, <a href="/A180292/b180292.txt">Table of n, a(n) for n=3..59</a> %F A180292 Empirical: a(n)=n*binomial(n,n-2) for n>4. %Y A180292 (n-2)nd entry in rows of A180281. %K A180292 nonn %O A180292 3,2 %A A180292 _R. H. Hardin_, formula from _Robert Gerbicz_ in the Sequence Fans Mailing List, Aug 24 2010