a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least 4 boxes remaining empty.
A370197
a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least 4 boxes remaining empty.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =5a(5) =81a(6) =658a(7) =3830a(8) =18525a(9) =80587a(10) =330330a(11) =1312015a(12) =5132075a(13) =19946915a(14) =77383374a(15) =300272554a(16) =1166405717a(17) =4536991655a(18) =17671814690a(19) =68922126879a(20) =269127380699
External references
- oeis: A370197