|
|
A263783
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and exactly two more elements moved upwards than downwards
|
|
1
|
|
|
0, 0, 0, 1, 5, 37, 116, 572, 2042, 9298, 35064, 149613, 562785, 2272083, 8551255, 33698121, 127422730, 495208463, 1874278884, 7209869659, 27281399998, 104270642849, 394494583551, 1501695837844, 5679621795233, 21560364546542
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..4....4....0....4....0....3....3....4....3....0....0....0....3....3....3....3
..0....0....2....0....4....0....1....0....5....3....5....3....0....0....1....0
..5....1....6....5....6....2....6....1....1....6....6....6....1....5....0....1
..1....5....1....1....2....6....0....3....0....1....2....2....6....2....2....5
..2....3....3....3....3....1....2....2....2....2....1....1....2....1....6....2
..3....2....4....2....1....4....4....6....4....4....4....4....5....4....4....4
..6....6....5....6....5....5....5....5....6....5....3....5....4....6....5....6
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|