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.

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

This page as a plain text file.
%I A263782 #6 Jul 23 2025 15:38:19
%S A263782 0,0,0,1,2,10,31,134,439,1604,5088,17115,54199,176073,552856,1755516,
%T A263782 5472509,17149688,53191180,165306987,510614655,1578127066,4859554763,
%U A263782 14963066678,45966984378,141165413462,432876102395,1326862831744
%N A263782 Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and exactly two more elements moved upwards than downwards.
%C A263782 Column 3 of A263787
%H A263782 R. H. Hardin, <a href="/A263782/b263782.txt">Table of n, a(n) for n = 1..210</a>
%e A263782 Some solutions for n=7
%e A263782 ..3....3....0....0....3....2....0....0....2....1....0....3....3....3....0....0
%e A263782 ..0....0....1....2....0....0....4....4....1....0....4....0....0....0....4....1
%e A263782 ..5....1....5....1....2....5....1....1....0....5....1....1....1....1....1....2
%e A263782 ..1....2....2....6....6....1....6....2....6....2....2....6....2....6....2....6
%e A263782 ..2....5....3....3....1....3....2....6....3....3....3....2....4....4....3....3
%e A263782 ..4....4....4....4....4....4....3....3....4....4....5....5....6....2....6....4
%e A263782 ..6....6....6....5....5....6....5....5....5....6....6....4....5....5....5....5
%Y A263782 Cf. A263787
%K A263782 nonn
%O A263782 1,5
%A A263782 _R. H. Hardin_, Oct 26 2015