Triangle T(n, k) = Number of ways to choose k points from an n X n X n triangular grid so that no three of them form a 2 X 2 X 2 subtriangle. Triangle T read by rows.
A234251
Triangle T(n, k) = Number of ways to choose k points from an n X n X n triangular grid so that no three of them form a 2 X 2 X 2 subtriangle. Triangle T read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =3a(5) =1a(6) =6a(7) =15a(8) =16a(9) =6a(10) =1a(11) =10a(12) =45a(13) =111a(14) =156a(15) =120a(16) =42a(17) =2a(18) =1a(19) =15a(20) =105a(21) =439a(22) =1191a(23) =2154a(24) =2583a(25) =1977a(26) =885a(27) =189a(28) =9a(29) =1
External references
- oeis: A234251