%I #4 Oct 22 2015 12:42:39
%S 1,2,6,16,52,208,676,2208,7696,25508,83880,283660,948060,3148584,
%T 10557340,35322344,117782000,393897360,1317263556,4398977356,
%U 14702092412,49147888808,164212896136,548766913936,1834139828140,6129193479188
%N Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and the median of every three consecutive elements nondecreasing.
%C Column 5 of A263597.
%H R. H. Hardin, <a href="/A263594/b263594.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) +a(n-2) +19*a(n-3) +7*a(n-4) +13*a(n-5) -3*a(n-6) +31*a(n-7) +71*a(n-8) +205*a(n-9) +389*a(n-10) -185*a(n-11) -235*a(n-12) +388*a(n-13) -368*a(n-14) -145*a(n-15) +1131*a(n-16) +256*a(n-17) -228*a(n-18) +218*a(n-19) -208*a(n-20) -1006*a(n-21) -248*a(n-22) -190*a(n-23) -308*a(n-24) -76*a(n-25) +36*a(n-26) -80*a(n-27) +104*a(n-28) +8*a(n-29) +16*a(n-31)
%e Some solutions for n=6
%e ..1....0....4....1....1....0....4....0....4....2....0....0....5....1....5....4
%e ..5....2....2....5....2....3....0....1....1....1....3....1....0....0....0....2
%e ..2....1....1....0....0....2....2....3....0....0....1....2....2....4....1....1
%e ..0....5....5....2....3....1....3....2....5....4....5....5....4....3....2....3
%e ..3....4....3....4....5....5....1....4....3....5....4....4....1....2....4....5
%e ..4....3....0....3....4....4....5....5....2....3....2....3....3....5....3....0
%Y Cf. A263597.
%K nonn
%O 1,2
%A _R. H. Hardin_, Oct 22 2015