A263783 - OEIS

%I #4 Oct 26 2015 06:35:53

%S 0,0,0,1,5,37,116,572,2042,9298,35064,149613,562785,2272083,8551255,

%T 33698121,127422730,495208463,1874278884,7209869659,27281399998,

%U 104270642849,394494583551,1501695837844,5679621795233,21560364546542

%N 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

%C Column 4 of A263787

%H R. H. Hardin, <a href="/A263783/b263783.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=7

%e ..4....4....0....4....0....3....3....4....3....0....0....0....3....3....3....3

%e ..0....0....2....0....4....0....1....0....5....3....5....3....0....0....1....0

%e ..5....1....6....5....6....2....6....1....1....6....6....6....1....5....0....1

%e ..1....5....1....1....2....6....0....3....0....1....2....2....6....2....2....5

%e ..2....3....3....3....3....1....2....2....2....2....1....1....2....1....6....2

%e ..3....2....4....2....1....4....4....6....4....4....4....4....5....4....4....4

%e ..6....6....5....6....5....5....5....5....6....5....3....5....4....6....5....6

%Y Cf. A263787

%K nonn

%O 1,5

%A _R. H. Hardin_, Oct 26 2015