Partition array in Abramowitz-Stegun order for the number of ways of putting n stones into a rectangular m X n grid of squares such that each of the m rows contains at least one stone.
A258152
Partition array in Abramowitz-Stegun order for the number of ways of putting n stones into a rectangular m X n grid of squares such that each of the m rows contains at least one stone.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =1a(4) =18a(5) =27a(6) =1a(7) =32a(8) =36a(9) =288a(10) =256a(11) =1a(12) =50a(13) =200a(14) =750a(15) =1500a(16) =5000a(17) =3125a(18) =1a(19) =72a(20) =450a(21) =400a(22) =1620a(23) =10800a(24) =3375a(25) =17280a(26) =48600a(27) =97200a(28) =46656a(29) =1
External references
- oeis: A258152