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 A263900 #4 Oct 29 2015 07:41:29 %S A263900 1,2,6,20,61,185,577,1788,5540,17165,52991,163600,504983,1557494, %T A263900 4800848,14791118,45548176,140205732,431413253,1326980704,4080331096, %U A263900 12542893726,38546177015,118428377799,363772262171,1117147291580,3430089594015 %N A263900 Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and the total absolute value of displacements not greater than 2*(n-1). %C A263900 Column 3 of A263905. %H A263900 R. H. Hardin, <a href="/A263900/b263900.txt">Table of n, a(n) for n = 1..210</a> %e A263900 Some solutions for n=7 %e A263900 ..3....1....1....1....1....1....0....1....0....1....1....0....0....0....0....0 %e A263900 ..0....4....2....0....2....0....2....0....1....0....2....1....1....2....1....1 %e A263900 ..1....0....0....4....0....4....5....5....2....5....4....5....3....5....5....5 %e A263900 ..5....3....6....2....3....2....4....3....6....3....0....2....5....4....2....6 %e A263900 ..2....2....5....5....4....3....1....2....5....2....6....6....4....1....6....3 %e A263900 ..4....6....3....6....6....5....3....6....3....4....3....4....2....6....3....2 %e A263900 ..6....5....4....3....5....6....6....4....4....6....5....3....6....3....4....4 %Y A263900 Cf. A263905. %K A263900 nonn %O A263900 1,2 %A A263900 _R. H. Hardin_, Oct 29 2015