Triangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.

A259051

Triangle T(n,m) for the number of ways to put n stones into an m X n square grid 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) =68a(8) =288a(9) =256a(10) =1a(11) =250a(12) =2250a(13) =5000a(14) =3125a(15) =1a(16) =922a(17) =15795a(18) =65880a(19) =97200a(20) =46656a(21) =1a(22) =3430a(23) =105987a(24) =739508a(25) =1932805a(26) =2117682a(27) =823543a(28) =1a(29) =12868

External references