|
|
A263588
|
|
Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
4, 134, 1992, 27650, 343431, 3777963, 38762619, 377102980, 3519017214, 31782863567, 279755669078, 2411988669554, 20450270031430, 171047927517261, 1414934370045463, 11599885089631470, 94407727875281839, 763843712572305864
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..2..5..6..9.14....1..2..3..4.14....1..2..3..8..9....1..5..6..7..9
..7..0..1.12..8....6..0..5..9..7....7..0.11..6..4...10..0..8..2.13
.11.10.13..3..4...11.12.10..8.13...12..5.10.14.13...11.12.14..3..4
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|