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.
Original entry on oeis.org
1, 1, 1, 1, 2, 4, 5, 2, 3, 10, 22, 24, 8, 1, 4, 22, 77, 153, 140, 47, 2, 5, 41, 217, 713, 1290, 1112, 322, 15, 7, 72, 530, 2557, 7374, 11743, 8783, 2412, 143, 1, 8, 116, 1149, 7661, 32477, 82988, 116154, 77690, 19621, 1220, 5, 10, 180, 2288, 20055, 116420, 433372
Offset: 1
Triangle begins
1;
1, 1, 1;
2, 4, 5, 2;
3, 10, 22, 24, 8, 1;
4, 22, 77, 153, 140, 47, 2;
5, 41, 217, 713, 1290, 1112, 322, 15;
7, 72, 530, 2557, 7374, 11743, 8783, 2412, 143, 1;
8, 116, 1149, 7661, 32477, 82988, 116154, 77690, 19621, 1220, 5;
...
There are e.g. T(8, 11) = 5 non-equivalent ways to arrange 11 indistinguishable points (X) on a triangular grid of side 8 so that no point triple is collinear. As examples of the 5 solutions the 2 symmetrical ones are shown.
. .
. . . .
. X . . X .
X . . X X . . X
X . . . X . X . X .
. . X X . . X . . . . X
. X . . . X . . . X . X . .
. . X . . X . . . . X . . X . .
A234351
Number of non-equivalent (mod D_3) ways to arrange 3 indistinguishable points on a triangular grid of side n so that no three points are collinear.
Original entry on oeis.org
1, 5, 22, 77, 217, 530, 1149, 2288, 4231, 7400, 12322, 19725, 30486, 45768, 66917, 95669
Offset: 2
There are a(3) = 5 non-equivalent ways to arrange 3 indistinguishable points (x) on a triangular grid of side 3:
x . x x x
. . x x x x . . x .
x . x . x . . . . . x x . x .
A234352
Number of non-equivalent (mod D_3) ways to arrange 4 indistinguishable points on a triangular grid of side n so that no three points are collinear.
Original entry on oeis.org
2, 24, 153, 713, 2557, 7661, 20055, 47153, 101821, 205322, 390580, 707708, 1229969, 2060777, 3344487
Offset: 3
There are a(3) = 2 non-equivalent ways to arrange 4 indistinguishable points (x) on a triangular grid of side 3:
x .
x x x x
. x . x . x
A234354
Number of non-equivalent (mod D_3) ways to arrange 6 indistinguishable points on a triangular grid of side n so that no three points are collinear.
Original entry on oeis.org
1, 47, 1112, 11743, 82988, 433372, 1820163, 6459496, 20287372, 57129426, 147915285, 356109110, 804785159, 1722171831
Offset: 4
There is a(4) = 1 non-equivalent way to arrange 6 indistinguishable points (x) on a triangular grid of side 4:
.
x x
x . x
. x x .
Showing 1-4 of 4 results.
Comments