cp's OEIS Frontend

A263593 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and the median of every three consecutive elements nondecreasing.

%I A263593 #4 Oct 22 2015 12:41:56
%S A263593 1,2,6,16,52,164,476,1428,4308,12816,38324,114924,343696,1028096,
%T A263593 3077672,9209704,27556452,82465380,246779888,738461796,2209820148,
%U A263593 6612853424,19788642456,59216642832,177203814880,530275470412,1586827690308
%N A263593 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and the median of every three consecutive elements nondecreasing.
%C A263593 Column 4 of A263597.
%H A263593 R. H. Hardin, <a href="/A263593/b263593.txt">Table of n, a(n) for n = 1..210</a>
%F A263593 Empirical: a(n) = a(n-1) +a(n-2) +12*a(n-3) +5*a(n-4) +7*a(n-5) +2*a(n-6) +17*a(n-7) +31*a(n-8) -9*a(n-9) -14*a(n-10) +10*a(n-11) -22*a(n-12) -4*a(n-13) -4*a(n-15)
%e A263593 Some solutions for n=6
%e A263593 ..2....4....1....1....1....1....1....1....0....0....0....1....0....0....3....4
%e A263593 ..1....1....5....0....5....0....0....0....5....4....1....3....1....3....2....0
%e A263593 ..3....2....2....2....0....2....2....5....1....1....2....2....3....2....0....1
%e A263593 ..4....5....0....3....2....5....3....3....2....2....4....0....5....1....4....3
%e A263593 ..0....0....4....4....4....3....5....2....4....3....5....4....2....4....5....5
%e A263593 ..5....3....3....5....3....4....4....4....3....5....3....5....4....5....1....2
%Y A263593 Cf. A263597.
%K A263593 nonn
%O A263593 1,2
%A A263593 _R. H. Hardin_, Oct 22 2015