|
|
A263696
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and every three consecutive elements having its maximum within 4 of its minimum.
|
|
2
|
|
|
1, 1, 2, 6, 24, 120, 288, 456, 768, 1508, 3434, 7560, 16024, 31872, 61704, 122464, 246296, 500506, 1015010, 2041372, 4098824, 8224718, 16535378, 33298104, 67036986, 134932118, 271438490, 545959366, 1098340012, 2209778140
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..3....4....4....6....0....0....4....0....4....0....0....6....1....2....1....1
..0....6....0....5....3....1....3....2....0....1....4....5....0....6....0....3
..2....2....1....4....1....2....6....1....3....3....1....4....3....5....3....0
..1....5....2....2....4....4....5....4....1....2....3....2....4....4....4....2
..4....1....5....0....2....6....2....5....5....5....5....0....5....3....6....4
..5....3....6....3....5....3....1....3....2....6....2....1....2....1....2....6
..6....0....3....1....6....5....0....6....6....4....6....3....6....0....5....5
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|