|
| |
|
|
A194478
|
|
Number of ways to arrange 6 indistinguishable points on an nXnXn triangular grid so that no three points are in the same row or diagonal
|
|
1
|
|
|
|
0, 0, 0, 1, 337, 8733, 96478, 668028, 3413828, 14054915, 49171641, 151422970, 420674150, 1073422309, 2550004472, 5699074284, 12082541388, 24462528078, 47555986746, 89173692795, 161899772067, 285517344145, 490447009030
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
COMMENTS
|
Column 6 of A194480
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..31
|
|
|
EXAMPLE
|
Some solutions for 5X5X5
......0..........0..........1..........0..........0..........1..........1
.....0.0........1.0........0.0........1.1........1.0........0.0........0.1
....1.1.0......0.0.1......0.1.0......0.0.0......1.0.1......0.1.0......1.0.0
...0.0.1.1....0.1.0.1....0.1.1.0....1.0.0.1....0.1.0.1....0.1.1.0....0.0.1.0
..1.0.0.0.1..1.0.0.1.0..1.0.0.0.1..0.1.1.0.0..0.1.0.0.0..0.0.1.0.1..0.0.1.1.0
|
|
|
CROSSREFS
|
Sequence in context: A160069 A201852 A184202 * A084231 A066478 A202443
Adjacent sequences: A194475 A194476 A194477 * A194479 A194480 A194481
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin Aug 26 2011
|
|
|
STATUS
|
approved
|
| |
|
|
