Triangle T(n,k) read by rows of number of ways k domicules can be placed on an n X n square (n >= 0, 0 <= k <= floor(n^2/2)).
A243424
Triangle T(n,k) read by rows of number of ways k domicules can be placed on an n X n square (n >= 0, 0 <= k <= floor(n^2/2)).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =6a(4) =3a(5) =1a(6) =20a(7) =110a(8) =180a(9) =58a(10) =1a(11) =42a(12) =657a(13) =4890a(14) =18343a(15) =33792a(16) =27380a(17) =7416a(18) =280a(19) =1a(20) =72a(21) =2172a(22) =36028a(23) =362643a(24) =2307376a(25) =9382388a(26) =24121696a(27) =37965171a(28) =34431880a(29) =16172160
External references
- oeis: A243424