Triangle T(n, k) = Number of non-equivalent (mod D_4) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows.
A235453
Triangle T(n, k) = Number of non-equivalent (mod D_4) ways to arrange k indistinguishable points on an n X n square grid so that no three of them are collinear. Triangle read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =2a(4) =1a(5) =1a(6) =3a(7) =8a(8) =13a(9) =15a(10) =5a(11) =1a(12) =3a(13) =21a(14) =70a(15) =181a(16) =217a(17) =142a(18) =28a(19) =4a(20) =6a(21) =49a(22) =290a(23) =1253a(24) =3192a(25) =4699a(26) =3385a(27) =1076a(28) =110a(29) =5
External references
- oeis: A235453