Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.
A239567
Triangle T(n, k) = Numbers of ways to place k points on a triangular grid of side n so that no two of them are adjacent. Triangle read by rows.
Terms
- a(0) =1a(1) =3a(2) =6a(3) =6a(4) =1a(5) =10a(6) =27a(7) =21a(8) =1a(9) =15a(10) =75a(11) =151a(12) =114a(13) =27a(14) =1a(15) =21a(16) =165a(17) =615a(18) =1137a(19) =999a(20) =353a(21) =27a(22) =28a(23) =315a(24) =1845a(25) =6100a(26) =11565a(27) =12231a(28) =6715a(29) =1686
External references
- oeis: A239567