cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A263709 #6 Jul 23 2025 15:35:39
%S A263709 1,2,6,24,120,144,108,108,144,240,384,616,960,1376,2048,3008,4488,
%T A263709 6816,10184,15344,23016
%N A263709 Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and every four consecutive elements having its maximum within 4 of its minimum.
%C A263709 Diagonal of A263714
%e A263709 Some solutions for n=7
%e A263709 ..1....5....0....1....6....0....3....6....0....3....0....6....0....0....0....0
%e A263709 ..0....6....4....0....2....2....0....5....1....6....3....5....1....1....1....1
%e A263709 ..2....4....1....3....5....1....1....4....3....5....1....2....3....3....2....4
%e A263709 ..3....2....2....2....3....3....4....3....2....4....4....3....4....2....4....2
%e A263709 ..4....3....3....4....1....5....2....2....5....2....5....1....5....4....3....5
%e A263709 ..6....1....5....6....4....4....5....1....4....1....2....4....6....6....6....3
%e A263709 ..5....0....6....5....0....6....6....0....6....0....6....0....2....5....5....6
%Y A263709 Cf. A263714
%K A263709 nonn
%O A263709 1,2
%A A263709 _R. H. Hardin_, Oct 24 2015