|
| |
|
|
A194479
|
|
Number of ways to arrange 7 indistinguishable points on an nXnXn triangular grid so that no three points are in the same row or diagonal
|
|
1
|
|
|
|
0, 0, 0, 0, 15, 3525, 98473, 1237434, 9821400, 57367112, 268378248, 1059987987, 3661533037, 11341971885, 32090198922, 84099053568, 206386405560, 478423135296, 1054963957500, 2225704950054, 4514320792971, 8838377453829
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
COMMENTS
|
Column 7 of A194480
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..24
|
|
|
EXAMPLE
|
Some solutions for 5X5X5
......0..........0..........1..........0..........0..........1..........1
.....1.0........0.1........0.0........1.0........0.1........0.0........0.0
....0.1.1......1.1.0......1.0.1......1.0.1......1.0.1......1.1.0......0.1.1
...1.0.0.1....1.0.0.1....0.1.1.0....0.1.1.0....1.0.1.0....0.0.1.1....1.1.0.0
..0.1.1.0.0..0.0.1.1.0..0.1.0.1.0..0.1.0.0.1..0.1.0.1.0..0.1.1.0.0..0.0.1.1.0
|
|
|
CROSSREFS
|
Sequence in context: A013720 A145189 A182283 * A153832 A198524 A208463
Adjacent sequences: A194476 A194477 A194478 * A194480 A194481 A194482
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin Aug 26 2011
|
|
|
STATUS
|
approved
|
| |
|
|
