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 A180298 #6 Jun 02 2025 03:03:33 %S A180298 1,8952,128865,440374,948090,1754116,3050775,5116200,8335338,13238478, %T A180298 20549925,31245500,46621575,68378310,98719335,140470200,197218125, %U A180298 273475800,374872212,508373712,682538780,907810200,1196848620,1564911744 %N A180298 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-8. %H A180298 R. H. Hardin, <a href="/A180298/b180298.txt">Table of n, a(n) for n=9..59</a> %F A180298 Empirical: a(n)=n*binomial(n+6,n-2) for n>16 %Y A180298 n-8th entry in rows of A180281 %K A180298 nonn %O A180298 9,2 %A A180298 _R. H. Hardin_, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010