|
|
A263504
|
|
Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 filled by rows with each element moved a city block distance of 0 1 or 2, and rows and columns in increasing lexicographic order.
|
|
1
|
|
|
48, 2282, 78306, 2785493, 101776538, 3683279274, 133026960133, 4808479742131, 173802713372738, 6281138389885133, 226994755038613609, 8203399088630864312, 296462278682139869597, 10713809820160562329300, 387184699917654176488277
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..3..5....0..2..4....0..2..5....0..2..5....0..3..4....0..3..5....0..3..8
..1..2..4....1..6..3....3..1..7....3..7..1....5..2..1....4..6..2....1..6..4
..8..6.10....9..7..8....4.11..8....4..9..8....8..9..7....8..1..7...10..9..2
.11..9..7...10.11..5...10..6..9....6.10.11...10..6.11....9.11.10...11..7..5
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|