cp's OEIS Frontend

A263701 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and every three consecutive elements having its maximum within 4 of its minimum.

%I A263701 #4 Oct 24 2015 06:46:53
%S A263701 1,2,6,24,120,288,456,488,754,1699,3744,7940,15748,30396,60160,120944,
%T A263701 246040,499256,1004336,2016168,4044432,8130660,16373500,32966620,
%U A263701 66358420,133489108,268489288,540125980,1086691764,2186585680,4399583284
%N A263701 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and every three consecutive elements having its maximum within 4 of its minimum.
%C A263701 Column 6 of A263703.
%H A263701 R. H. Hardin, <a href="/A263701/b263701.txt">Table of n, a(n) for n = 1..210</a>
%F A263701 Empirical: a(n) = a(n-1) +a(n-2) +7*a(n-5) +2*a(n-6) +a(n-7) +5*a(n-8) -4*a(n-9) -3*a(n-10) -3*a(n-11) -4*a(n-12) -4*a(n-14) -a(n-15) +3*a(n-16) -a(n-17) +a(n-19) for n>31
%e A263701 Some solutions for n=7
%e A263701 ..2....0....6....6....0....4....1....4....1....1....3....4....1....6....6....6
%e A263701 ..6....4....4....3....1....6....0....0....0....0....6....0....0....4....3....4
%e A263701 ..3....1....2....5....4....3....4....1....4....4....5....1....3....5....5....5
%e A263701 ..5....5....5....2....3....5....3....2....3....3....2....3....4....1....2....3
%e A263701 ..4....3....3....4....5....2....6....3....2....5....4....5....6....3....1....1
%e A263701 ..1....6....1....0....6....1....2....5....6....2....1....2....5....2....4....0
%e A263701 ..0....2....0....1....2....0....5....6....5....6....0....6....2....0....0....2
%Y A263701 Cf. A263703.
%K A263701 nonn
%O A263701 1,2
%A A263701 _R. H. Hardin_, Oct 24 2015