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.

A263740 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and equal numbers of elements moved upwards and downwards.

This page as a plain text file.
%I A263740 #6 Jul 23 2025 15:36:30
%S A263740 1,2,4,14,46,214,664,2516,7989,30299,104622,399316,1411880,5298114,
%T A263740 18971986,70774024,256952680,957861715,3507882839,13059944402,
%U A263740 48088198908,178984147550,661805950128,2464463156096,9141021963396
%N A263740 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and equal numbers of elements moved upwards and downwards.
%C A263740 Column 4 of A263744
%H A263740 R. H. Hardin, <a href="/A263740/b263740.txt">Table of n, a(n) for n = 1..210</a>
%e A263740 Some solutions for n=7
%e A263740 ..3....1....4....0....0....4....1....4....4....1....0....1....2....4....0....1
%e A263740 ..1....5....2....1....2....1....5....2....2....0....1....0....1....5....5....4
%e A263740 ..0....2....0....2....5....0....0....1....5....2....5....5....6....3....4....0
%e A263740 ..2....0....5....5....3....6....3....3....0....3....3....4....5....1....1....2
%e A263740 ..5....4....3....3....1....5....6....0....1....6....6....3....0....0....3....6
%e A263740 ..6....3....1....6....4....2....4....5....3....5....4....2....3....2....6....5
%e A263740 ..4....6....6....4....6....3....2....6....6....4....2....6....4....6....2....3
%Y A263740 Cf. A263744
%K A263740 nonn
%O A263740 1,2
%A A263740 _R. H. Hardin_, Oct 25 2015