cp's OEIS Frontend

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

%I A263699 #4 Oct 24 2015 06:45:27
%S A263699 1,2,6,24,120,168,204,348,696,1601,3476,7244,14048,27164,54300,109741,
%T A263699 223641,452621,908389,1822758,3657710,7359642,14825163,29845108,
%U A263699 60064056,120806672,242986234,488854773,983578792,1979138437,3982088115
%N A263699 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every three consecutive elements having its maximum within 4 of its minimum.
%C A263699 Column 4 of A263703.
%H A263699 R. H. Hardin, <a href="/A263699/b263699.txt">Table of n, a(n) for n = 1..210</a>
%F A263699 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>27
%e A263699 Some solutions for n=7
%e A263699 ..1....1....0....3....0....1....0....0....2....1....0....0....2....1....1....3
%e A263699 ..0....0....3....1....4....0....4....1....0....2....1....2....3....3....0....0
%e A263699 ..4....3....1....0....1....4....1....3....1....0....3....1....0....0....2....2
%e A263699 ..2....2....4....2....2....3....2....5....3....3....2....4....1....4....3....1
%e A263699 ..6....5....2....4....5....2....3....6....5....4....4....5....4....2....6....4
%e A263699 ..3....4....6....5....3....5....6....4....6....5....5....6....5....5....4....5
%e A263699 ..5....6....5....6....6....6....5....2....4....6....6....3....6....6....5....6
%Y A263699 Cf. A263703.
%K A263699 nonn
%O A263699 1,2
%A A263699 _R. H. Hardin_, Oct 24 2015