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.

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

This page as a plain text file.
%I A263738 #7 Jul 23 2025 15:36:17
%S A263738 1,2,4,10,19,43,90,202,434,971,2133,4780,10634,23918,53667,121159,
%T A263738 273464,619510,1404284,3190779,7256305,16529258,37686110,86028558,
%U A263738 196547581,449479587,1028674074,2356054490,5399827384,12383951473,28417821421
%N A263738 Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and equal numbers of elements moved upwards and downwards.
%C A263738 Column 2 of A263744
%H A263738 R. H. Hardin, <a href="/A263738/b263738.txt">Table of n, a(n) for n = 1..210</a>
%e A263738 Some solutions for n=7
%e A263738 ..0....2....1....2....1....0....0....1....2....1....0....0....2....2....0....2
%e A263738 ..1....0....0....1....0....1....2....3....1....0....1....2....1....1....3....0
%e A263738 ..3....3....2....0....3....3....1....0....0....4....2....4....0....0....4....3
%e A263738 ..5....1....5....5....2....2....3....5....4....2....3....1....3....5....1....1
%e A263738 ..2....4....3....4....4....6....6....2....3....5....5....3....4....3....2....5
%e A263738 ..4....5....6....3....5....5....5....4....5....3....4....6....5....6....6....4
%e A263738 ..6....6....4....6....6....4....4....6....6....6....6....5....6....4....5....6
%Y A263738 Cf. A263744
%K A263738 nonn
%O A263738 1,2
%A A263738 _R. H. Hardin_, Oct 25 2015