cp's OEIS Frontend

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.

A180297 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-7.

This page as a plain text file.
%I A180297 #6 Jun 02 2025 03:03:28
%S A180297 1,3138,35850,110715,228294,412698,705341,1162800,1860480,2899248,
%T A180297 4412826,6575976,9614000,13813800,19536660,27232920,37458720,50895000,
%U A180297 68368950,90878112,119617344,156008864,201735600,258778080,329455104
%N A180297 Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-7.
%H A180297 R. H. Hardin, <a href="/A180297/b180297.txt">Table of n, a(n) for n=8..59</a>
%F A180297 Empirical: a(n)=n*binomial(n+5,n-2) for n>14
%Y A180297 n-7th entry in rows of A180281
%K A180297 nonn
%O A180297 8,2
%A A180297 _R. H. Hardin_, formula from Robert Gerbicz in the Sequence Fans Mailing List, Aug 24 2010