a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least one box remaining empty and not all balls placed in a single box.
A371036
a(n) is the number of ways to place n indistinguishable balls into n distinguishable boxes with at least one box remaining empty and not all balls placed in a single box.
Terms
- a(0) =0a(1) =0a(2) =6a(3) =30a(4) =120a(5) =455a(6) =1708a(7) =6426a(8) =24300a(9) =92367a(10) =352704a(11) =1352065a(12) =5200286a(13) =20058285a(14) =77558744a(15) =300540178a(16) =1166803092a(17) =4537567631a(18) =17672631880a(19) =68923264389a(20) =269128937198
External references
- oeis: A371036