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.

A263786 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly two more elements moved upwards than downwards.

This page as a plain text file.
%I A263786 #6 Jul 23 2025 15:38:39
%S A263786 0,0,0,1,5,66,392,4859,26994,232208,1161998,8246455,41787717,
%T A263786 274395962,1457963344,9504972075,53127306403,343749866061,
%U A263786 1960779086021,12451275397390,71531553827855,445155989823862,2568693912325240
%N A263786 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly two more elements moved upwards than downwards.
%C A263786 Column 7 of A263787
%H A263786 R. H. Hardin, <a href="/A263786/b263786.txt">Table of n, a(n) for n = 1..45</a>
%e A263786 Some solutions for n=7
%e A263786 ..6....6....0....4....6....6....5....3....2....6....5....0....6....4....5....6
%e A263786 ..0....1....6....0....4....5....6....0....0....5....4....5....1....0....0....1
%e A263786 ..5....2....1....5....1....1....2....6....6....2....1....1....5....1....6....4
%e A263786 ..2....0....5....2....2....2....0....1....1....0....2....2....0....6....1....2
%e A263786 ..4....3....2....1....3....4....3....4....3....3....0....4....3....3....4....0
%e A263786 ..1....5....3....3....5....3....1....2....5....1....3....3....2....5....3....3
%e A263786 ..3....4....4....6....0....0....4....5....4....4....6....6....4....2....2....5
%Y A263786 Cf. A263787
%K A263786 nonn
%O A263786 1,5
%A A263786 _R. H. Hardin_, Oct 26 2015