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.

A263760 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and exactly one more element moved upwards than downwards.

This page as a plain text file.
%I A263760 #6 Jul 23 2025 15:37:49
%S A263760 0,0,1,4,31,106,485,1546,6083,21020,83505,298850,1157277,4174794,
%T A263760 15848043,57833610,218278105,803890160,3022404618,11185043168,
%U A263760 41937855185,155739217814,583290598528,2171877488824,8131306069328
%N A263760 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and exactly one more element moved upwards than downwards.
%C A263760 Column 4 of A263764
%H A263760 R. H. Hardin, <a href="/A263760/b263760.txt">Table of n, a(n) for n = 1..210</a>
%e A263760 Some solutions for n=7
%e A263760 ..3....0....2....4....0....2....4....4....4....2....0....2....4....4....1....4
%e A263760 ..0....3....5....1....5....0....5....0....3....4....2....0....1....0....4....5
%e A263760 ..2....6....1....0....2....5....6....2....1....0....6....6....0....1....6....0
%e A263760 ..1....1....0....3....1....1....2....5....2....6....3....5....5....3....0....6
%e A263760 ..5....4....6....2....6....6....0....1....0....3....1....3....3....5....3....1
%e A263760 ..4....2....3....5....3....4....1....3....5....1....4....1....2....2....2....3
%e A263760 ..6....5....4....6....4....3....3....6....6....5....5....4....6....6....5....2
%Y A263760 Cf. A263764
%K A263760 nonn
%O A263760 1,4
%A A263760 _R. H. Hardin_, Oct 25 2015