|
|
A263758
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly one more element moved upwards than downwards
|
|
1
|
|
|
0, 0, 1, 2, 6, 14, 38, 88, 217, 506, 1209, 2810, 6600, 15308, 35653, 82532, 191371, 442428, 1023499, 2364324, 5463084, 12614628, 29131729, 67256334, 155289747, 358522126, 827816037, 1911447100, 4414086763, 10194246046, 23546391253
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..0....0....1....2....2....1....2....2....0....2....0....2....2....1....0....0
..3....1....0....0....0....0....0....1....2....0....1....0....0....0....2....3
..1....2....3....1....1....4....1....0....1....4....3....1....4....2....1....1
..2....3....2....3....3....2....5....5....3....1....2....5....1....3....5....5
..5....6....6....6....5....6....6....3....6....6....6....3....3....6....3....2
..4....4....4....5....4....3....3....4....4....3....4....6....5....4....4....4
..6....5....5....4....6....5....4....6....5....5....5....4....6....5....6....6
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|