Triangle T(n, k) = Number of non-equivalent (mod D_3) ways to arrange k indistinguishable points on a triangular grid of side n so that no three points are collinear. Triangle read by rows.
A234350
Triangle T(n, k) = Number of non-equivalent (mod D_3) ways to arrange k indistinguishable points on a triangular grid of side n so that no three points are collinear. Triangle read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =4a(6) =5a(7) =2a(8) =3a(9) =10a(10) =22a(11) =24a(12) =8a(13) =1a(14) =4a(15) =22a(16) =77a(17) =153a(18) =140a(19) =47a(20) =2a(21) =5a(22) =41a(23) =217a(24) =713a(25) =1290a(26) =1112a(27) =322a(28) =15a(29) =7
External references
- oeis: A234350