Triangle read by rows: T(n,k) is number of ways of arranging n indistinguishable points on an n X n square grid such that k rows contain at least one point.

A258371

Triangle read by rows: T(n,k) is number of ways of arranging n indistinguishable points on an n X n square grid such that k rows contain at least one point.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =3a(4) =54a(5) =27a(6) =4a(7) =408a(8) =1152a(9) =256a(10) =5a(11) =2500a(12) =22500a(13) =25000a(14) =3125a(15) =6a(16) =13830a(17) =315900a(18) =988200a(19) =583200a(20) =46656a(21) =7a(22) =72030a(23) =3709545a(24) =25882780a(25) =40588905a(26) =14823774a(27) =823543a(28) =8a(29) =360304

External references