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.

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

This page as a plain text file.
%I A263758 #7 Jul 23 2025 15:37:35
%S A263758 0,0,1,2,6,14,38,88,217,506,1209,2810,6600,15308,35653,82532,191371,
%T A263758 442428,1023499,2364324,5463084,12614628,29131729,67256334,155289747,
%U A263758 358522126,827816037,1911447100,4414086763,10194246046,23546391253
%N A263758 Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly one more element moved upwards than downwards.
%C A263758 Column 2 of A263764
%H A263758 R. H. Hardin, <a href="/A263758/b263758.txt">Table of n, a(n) for n = 1..210</a>
%e A263758 Some solutions for n=7
%e A263758 ..0....0....1....2....2....1....2....2....0....2....0....2....2....1....0....0
%e A263758 ..3....1....0....0....0....0....0....1....2....0....1....0....0....0....2....3
%e A263758 ..1....2....3....1....1....4....1....0....1....4....3....1....4....2....1....1
%e A263758 ..2....3....2....3....3....2....5....5....3....1....2....5....1....3....5....5
%e A263758 ..5....6....6....6....5....6....6....3....6....6....6....3....3....6....3....2
%e A263758 ..4....4....4....5....4....3....3....4....4....3....4....6....5....4....4....4
%e A263758 ..6....5....5....4....6....5....4....6....5....5....5....4....6....5....6....6
%Y A263758 Cf. A263764
%K A263758 nonn
%O A263758 1,4
%A A263758 _R. H. Hardin_, Oct 25 2015