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 A263903 #4 Oct 29 2015 07:43:38 %S A263903 1,2,6,20,76,300,1252,5197,21735,91151,384641,1629124,6927800, %T A263903 29539650,126281489,540980783,2321907944,9982050981,42977082052, %U A263903 185279158666,799716576405,3455546697332,14946086528673,64704061451845 %N A263903 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and the total absolute value of displacements not greater than 2*(n-1). %C A263903 Column 6 of A263905. %H A263903 R. H. Hardin, <a href="/A263903/b263903.txt">Table of n, a(n) for n = 1..55</a> %e A263903 Some solutions for n=7 %e A263903 ..4....0....4....3....3....2....0....1....1....1....0....1....0....6....1....3 %e A263903 ..1....3....1....0....1....4....4....4....0....0....1....5....1....0....0....2 %e A263903 ..2....5....3....2....2....0....3....0....4....3....4....2....3....1....2....0 %e A263903 ..3....2....2....6....0....3....2....3....3....2....6....3....2....2....5....1 %e A263903 ..6....1....0....4....5....5....6....2....6....4....3....0....4....4....3....5 %e A263903 ..5....4....5....5....6....1....1....6....5....5....5....6....6....5....6....4 %e A263903 ..0....6....6....1....4....6....5....5....2....6....2....4....5....3....4....6 %Y A263903 Cf. A263905. %K A263903 nonn %O A263903 1,2 %A A263903 _R. H. Hardin_, Oct 29 2015