A263782 - OEIS

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

%S 0,0,0,1,2,10,31,134,439,1604,5088,17115,54199,176073,552856,1755516,

%T 5472509,17149688,53191180,165306987,510614655,1578127066,4859554763,

%U 14963066678,45966984378,141165413462,432876102395,1326862831744

%N Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and exactly two more elements moved upwards than downwards

%C Column 3 of A263787

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

%e Some solutions for n=7

%e ..3....3....0....0....3....2....0....0....2....1....0....3....3....3....0....0

%e ..0....0....1....2....0....0....4....4....1....0....4....0....0....0....4....1

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

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

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

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

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

%Y Cf. A263787

%K nonn

%O 1,5

%A _R. H. Hardin_, Oct 26 2015