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.

A263904 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the total absolute value of displacements not greater than 2*(n-1).

This page as a plain text file.
%I A263904 #4 Oct 29 2015 07:44:22
%S A263904 1,2,6,20,76,300,1252,5324,22869,98497,426139,1850782,8067832,
%T A263904 35280090,154696678,679891308,2994160190,13209317445,58367173629,
%U A263904 258266895944,1144247729578,5075406674186,22535970467972,100160698537196
%N A263904 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the total absolute value of displacements not greater than 2*(n-1).
%C A263904 Column 7 of A263905.
%H A263904 R. H. Hardin, <a href="/A263904/b263904.txt">Table of n, a(n) for n = 1..38</a>
%e A263904 Some solutions for n=7
%e A263904 ..1....0....2....4....2....6....1....2....1....0....0....1....4....4....2....3
%e A263904 ..3....4....5....0....1....1....6....0....3....4....3....2....1....1....1....0
%e A263904 ..5....1....0....3....0....2....0....5....2....3....2....0....2....2....0....5
%e A263904 ..0....6....3....1....4....3....2....3....4....1....5....5....3....0....3....1
%e A263904 ..2....2....1....2....3....0....4....1....5....5....1....6....6....3....4....2
%e A263904 ..4....3....4....6....6....5....3....6....0....6....4....4....0....5....5....4
%e A263904 ..6....5....6....5....5....4....5....4....6....2....6....3....5....6....6....6
%Y A263904 Cf. A263905.
%K A263904 nonn
%O A263904 1,2
%A A263904 _R. H. Hardin_, Oct 29 2015