cp's OEIS Frontend

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

%I A263696 #14 Apr 08 2020 19:37:43
%S A263696 1,1,2,6,24,120,288,456,768,1508,3434,7560,16024,31872,61704,122464,
%T A263696 246296,500506,1015010,2041372,4098824,8224718,16535378,33298104,
%U A263696 67036986,134932118,271438490,545959366,1098340012,2209778140
%N A263696 Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and every three consecutive elements having its maximum within 4 of its minimum.
%e A263696 Some solutions for n=7
%e A263696 ..3....4....4....6....0....0....4....0....4....0....0....6....1....2....1....1
%e A263696 ..0....6....0....5....3....1....3....2....0....1....4....5....0....6....0....3
%e A263696 ..2....2....1....4....1....2....6....1....3....3....1....4....3....5....3....0
%e A263696 ..1....5....2....2....4....4....5....4....1....2....3....2....4....4....4....2
%e A263696 ..4....1....5....0....2....6....2....5....5....5....5....0....5....3....6....4
%e A263696 ..5....3....6....3....5....3....1....3....2....6....2....1....2....1....2....6
%e A263696 ..6....0....3....1....6....5....0....6....6....4....6....3....6....0....5....5
%Y A263696 Diagonal of A263703.
%Y A263696 Cf. A333833.
%K A263696 nonn
%O A263696 0,3
%A A263696 _R. H. Hardin_, Oct 24 2015
%E A263696 a(0), a(23)-a(29) from _Alois P. Heinz_, Apr 08 2020