T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no four points are in the same row or diagonal.
A194485
T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no four points are in the same row or diagonal.
Terms
- a(0) =1a(1) =0a(2) =3a(3) =0a(4) =3a(5) =6a(6) =0a(7) =1a(8) =15a(9) =10a(10) =0a(11) =0a(12) =20a(13) =45a(14) =15a(15) =0a(16) =0a(17) =15a(18) =120a(19) =105a(20) =21a(21) =0a(22) =0a(23) =6a(24) =207a(25) =455a(26) =210a(27) =28a(28) =0a(29) =0
External references
- oeis: A194485