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 A180293 #10 Apr 10 2014 09:14:34 %S A180293 1,50,195,392,672,1080,1650,2420,3432,4732,6370,8400,10880,13872, %T A180293 17442,21660,26600,32340,38962,46552,55200,65000,76050,88452,102312, %U A180293 117740,134850,153760,174592,197472,222530,249900,279720,312132,347282,385320 %N A180293 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-3. %H A180293 R. H. Hardin, <a href="/A180293/b180293.txt">Table of n, a(n) for n=4..59</a> %F A180293 Empirical: a(n) = n*binomial(n+1, n-2) for n>6. %Y A180293 (n-3)rd entry in rows of A180281. %K A180293 nonn %O A180293 4,2 %A A180293 _R. H. Hardin_, formula from _Robert Gerbicz_ in the Sequence Fans Mailing List, Aug 24 2010