|
%I #4 Oct 25 2015 10:27:07
%S 1,2,4,14,36,110,277,823,2292,6862,19518,57932,167852,499181,1464997,
%T 4360738,12891144,38436616,114235572,341264028,1018047671,3046747775,
%U 9114371288,27322966348,81915150788,245937559472,738620368466
%N Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and equal numbers of elements moved upwards and downwards
%C Column 3 of A263744
%H R. H. Hardin, <a href="/A263739/b263739.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=7
%e ..0....1....1....2....0....0....3....0....1....2....3....1....0....3....0....2
%e ..1....0....3....0....1....3....2....3....4....1....1....3....2....2....3....4
%e ..2....4....0....3....5....1....0....4....0....5....4....0....5....0....1....0
%e ..4....6....2....1....4....4....5....1....2....0....0....6....6....6....5....1
%e ..6....2....4....6....3....6....1....2....6....4....2....2....1....1....2....5
%e ..3....5....5....5....2....2....4....6....5....3....6....5....4....5....6....3
%e ..5....3....6....4....6....5....6....5....3....6....5....4....3....4....4....6
%Y Cf. A263744
%K nonn
%O 1,2
%A _R. H. Hardin_, Oct 25 2015
| 