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 A180295 #6 Jun 02 2025 03:03:23 %S A180295 1,392,2716,6804,12825,22022,36036,56784,86632,128520,186048,263568, %T A180295 366282,500346,672980,892584,1168860,1512940,1937520,2457000,3087630, %U A180295 3847662,4757508,5839904,7120080,8625936,10388224,12440736,14820498 %N A180295 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-5. %H A180295 R. H. Hardin, <a href="/A180295/b180295.txt">Table of n, a(n) for n=6..59</a> %F A180295 Empirical: a(n)=n*binomial(n+3,n-2) for n>10 %Y A180295 n-5th entry in rows of A180281 %K A180295 nonn %O A180295 6,2 %A A180295 _R. H. Hardin_, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010