|
|
A215290
|
|
Number of permutations of 0..floor((n*6-1)/2) on even squares of an nX6 array such that each row and column of even squares is increasing
|
|
2
|
|
|
1, 20, 420, 23100, 1051050, 85765680, 5703417720, 577185873264, 48236247979920, 5595404765670720, 545152292883918720, 69506917342699636800, 7562187114225380722800, 1033498905610802032116000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
f3=floor((n+1)/2)
f4=floor(n/2)
|
|
EXAMPLE
|
Some solutions for n=4
..0..x..2..x..6..x....1..x..6..x..7..x....1..x..2..x..7..x....0..x..2..x..6..x
..x..1..x..3..x..5....x..0..x..2..x..4....x..0..x..4..x.10....x..3..x..5..x..7
..4..x..9..x.10..x....9..x.10..x.11..x....3..x..6..x..8..x....1..x..9..x.11..x
..x..7..x..8..x.11....x..3..x..5..x..8....x..5..x..9..x.11....x..4..x..8..x.10
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|