|
|
A263763
|
|
Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly one more element moved upwards than downwards
|
|
1
|
|
|
0, 0, 1, 4, 31, 146, 1289, 7736, 68811, 354568, 2562282, 12614090, 80560052, 406847624, 2530379183, 13576171696, 85562497735, 476311791218, 2983359368303, 16861046247216, 104017882519889, 591843352618090, 3599197579892399
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=7
..0....4....1....3....3....3....6....4....2....2....2....6....5....6....6....6
..1....6....5....6....6....5....5....3....0....5....6....5....0....4....0....0
..2....0....6....5....5....2....1....6....3....0....0....0....2....1....2....4
..6....1....2....2....2....0....4....1....6....6....5....3....4....3....3....1
..3....5....3....0....1....1....0....0....1....3....1....4....3....2....4....5
..5....2....4....1....4....4....3....2....4....1....4....2....1....5....5....3
..4....3....0....4....0....6....2....5....5....4....3....1....6....0....1....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|