Triangle T(n, k) = Number of ways to arrange k indistinguishable points on an n X n square grid so that no four of them are vertices of a square of any orientation.

A240444

Triangle T(n, k) = Number of ways to arrange k indistinguishable points on an n X n square grid so that no four of them are vertices of a square of any orientation.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =4a(4) =6a(5) =4a(6) =1a(7) =9a(8) =36a(9) =84a(10) =120a(11) =96a(12) =32a(13) =1a(14) =16a(15) =120a(16) =560a(17) =1800a(18) =4128a(19) =6726a(20) =7492a(21) =5238a(22) =1924a(23) =232a(24) =1a(25) =25a(26) =300a(27) =2300a(28) =12600a(29) =52080

External references