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.
%I A263901 #4 Oct 29 2015 07:42:08 %S A263901 1,2,6,20,76,269,979,3552,13068,47999,177283,655064,2425417,8986341, %T A263901 33341753,123816292,460226315,1711870476,6371885563,23731057146, %U A263901 88430326347,329681018798,1229642693864,4588155649388,17126079485326 %N A263901 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and the total absolute value of displacements not greater than 2*(n-1). %C A263901 Column 4 of A263905. %H A263901 R. H. Hardin, <a href="/A263901/b263901.txt">Table of n, a(n) for n = 1..210</a> %e A263901 Some solutions for n=7 %e A263901 ..1....1....0....4....1....1....0....2....4....1....0....2....1....0....0....0 %e A263901 ..0....0....3....1....5....0....2....1....0....2....3....0....0....1....1....4 %e A263901 ..3....5....2....0....0....4....1....5....1....3....5....1....4....5....5....5 %e A263901 ..4....2....4....3....4....3....5....0....3....4....2....4....5....6....4....3 %e A263901 ..5....6....1....5....3....6....3....4....2....0....1....6....3....4....2....2 %e A263901 ..2....4....6....2....2....2....6....3....6....6....4....3....6....2....6....1 %e A263901 ..6....3....5....6....6....5....4....6....5....5....6....5....2....3....3....6 %Y A263901 Cf. A263905. %K A263901 nonn %O A263901 1,2 %A A263901 _R. H. Hardin_, Oct 29 2015