|
%I #4 Oct 26 2015 06:37:28
%S 0,0,0,1,5,66,392,3522,15699,104014,463811,2735525,12858073,74523350,
%T 369725340,2110660483,10653316753,59256398945,300481718854,
%U 1633653025795,8329842362903,44742563812167,229817730687508,1226116608834208
%N Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and exactly two more elements moved upwards than downwards
%C Column 6 of A263787
%H R. H. Hardin, <a href="/A263785/b263785.txt">Table of n, a(n) for n = 1..96</a>
%e Some solutions for n=7
%e ..4....0....6....5....6....0....6....2....0....5....4....3....3....6....6....4
%e ..0....6....0....6....5....6....5....0....6....1....1....5....0....0....0....0
%e ..1....5....2....0....1....3....1....1....1....0....0....0....1....4....1....6
%e ..3....1....3....3....3....2....3....6....4....2....2....1....2....2....4....2
%e ..2....2....1....2....2....1....0....4....3....6....3....2....5....1....3....3
%e ..6....4....5....1....4....4....4....3....2....4....6....4....4....5....5....5
%e ..5....3....4....4....0....5....2....5....5....3....5....6....6....3....2....1
%Y Cf. A263787
%K nonn
%O 1,5
%A _R. H. Hardin_, Oct 26 2015
| 