|
|
A263709
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and every four consecutive elements having its maximum within 4 of its minimum
|
|
0
|
|
|
1, 2, 6, 24, 120, 144, 108, 108, 144, 240, 384, 616, 960, 1376, 2048, 3008, 4488, 6816, 10184, 15344, 23016
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..1....5....0....1....6....0....3....6....0....3....0....6....0....0....0....0
..0....6....4....0....2....2....0....5....1....6....3....5....1....1....1....1
..2....4....1....3....5....1....1....4....3....5....1....2....3....3....2....4
..3....2....2....2....3....3....4....3....2....4....4....3....4....2....4....2
..4....3....3....4....1....5....2....2....5....2....5....1....5....4....3....5
..6....1....5....6....4....4....5....1....4....1....2....4....6....6....6....3
..5....0....6....5....0....6....6....0....6....0....6....0....2....5....5....6
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|