|
|
A240444
|
|
Triangle T(n, k) = Number of ways to arrange k indistinguishable points on an n X n square grid so that no four of them are vertices of a square of any orientation.
|
|
4
|
|
|
1, 1, 1, 4, 6, 4, 1, 9, 36, 84, 120, 96, 32, 1, 16, 120, 560, 1800, 4128, 6726, 7492, 5238, 1924, 232, 1, 25, 300, 2300, 12600, 52080, 166702, 416622, 808488, 1196196, 1306464, 1001364, 497940, 141336, 18208, 636, 1, 36, 630, 7140, 58800, 373632, 1895938, 7835492
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
The triangle is irregularly shaped: 0 <= k <= A240443(n). The first row corresponds to n = 1.
The maximal number of points that can be placed on an n X n square grid so that no four points are vertices of a square is A240443(n).
|
|
LINKS
|
|
|
EXAMPLE
|
The triangle begins:
1, 1;
1, 4, 6, 4;
1, 9, 36, 84, 120, 96, 32;
1, 16, 120, 560, 1800, 4128, 6726, 7492, 5238, 1924, 232;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
tabf,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|