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.

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

This page as a plain text file.
%I A263759 #6 Jul 23 2025 15:37:42
%S A263759 0,0,1,4,19,50,165,476,1543,4544,14108,41666,127313,379674,1152233,
%T A263759 3448844,10424890,31290646,94453041,284071264,857114281,2581411140,
%U A263759 7789677889,23486717204,70901078303,213968862304,646246694302
%N A263759 Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and exactly one more element moved upwards than downwards.
%C A263759 Column 3 of A263764
%H A263759 R. H. Hardin, <a href="/A263759/b263759.txt">Table of n, a(n) for n = 1..210</a>
%e A263759 Some solutions for n=7
%e A263759 ..2....2....2....3....3....3....3....0....3....2....0....2....0....1....3....0
%e A263759 ..0....0....1....0....0....2....4....2....2....0....3....1....1....0....4....3
%e A263759 ..1....3....5....4....2....0....0....5....0....5....2....0....5....2....0....5
%e A263759 ..5....1....0....6....1....6....6....1....1....1....1....3....3....3....1....1
%e A263759 ..3....6....3....1....4....1....1....3....6....4....6....6....2....6....2....2
%e A263759 ..6....4....4....2....5....4....2....4....4....3....4....4....4....4....6....4
%e A263759 ..4....5....6....5....6....5....5....6....5....6....5....5....6....5....5....6
%Y A263759 Cf. A263764
%K A263759 nonn
%O A263759 1,4
%A A263759 _R. H. Hardin_, Oct 25 2015