|
|
A264557
|
|
Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3.
|
|
8
|
|
|
1, 1, 1, 2, 4, 8, 24, 72, 216, 864, 3456, 13824, 69120, 345600, 1728000, 10368000, 62208000, 373248000, 2612736000, 18289152000, 128024064000, 1024192512000, 8193540096000, 65548320768000, 589934886912000, 5309413982208000, 47784725839872000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Product_{i=0..2} ceiling((n-i)/3)!. - Alois P. Heinz, Jul 09 2016
|
|
EXAMPLE
|
All solutions for n=4
..0....3
..3....0
..1....1
..2....2
|
|
MATHEMATICA
|
Table[Product[Floor[(n + i)/3]!, {i, 0, 2}], {n, 1, 30}] (* Vaclav Kotesovec, Oct 02 2018 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|