|
|
A215296
|
|
Number of permutations of 0..floor((n*7-2)/2) on odd squares of an nX7 array such that each row and column of odd squares is increasing
|
|
1
|
|
|
1, 35, 1050, 210210, 14294280, 5703417720, 577185873264, 337653735859440, 43364386933948080, 32436561426593163840, 4886336289191784467040, 4340695403565368534887200, 733267473530864041786302000
(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=3
..x..0..x..1..x..3..x....x..0..x..2..x..5..x....x..0..x..1..x..3..x
..2..x..4..x..6..x..9....3..x..6..x..8..x..9....5..x..6..x..8..x..9
..x..5..x..7..x..8..x....x..1..x..4..x..7..x....x..2..x..4..x..7..x
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|