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 A263761 #6 Oct 01 2021 18:40:24 %S A263761 0,0,1,4,31,146,961,3662,18444,69848,326102,1330424,6299674,26712358, %T A263761 124560630,533971782,2439626795,10546384942,47745529864,208543550082, %U A263761 940653815829,4138965244350,18611240779758,82249270808254 %N A263761 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and exactly one more element moved upwards than downwards. %C A263761 Column 5 of A263764. %H A263761 R. H. Hardin, <a href="/A263761/b263761.txt">Table of n, a(n) for n = 1..178</a> %e A263761 Some solutions for n=7 %e A263761 ..1....0....1....5....4....2....0....0....3....5....0....5....5....5....0....3 %e A263761 ..6....6....5....3....5....6....1....6....4....0....6....3....3....2....5....1 %e A263761 ..2....2....0....0....1....0....2....2....1....4....2....0....0....0....4....0 %e A263761 ..3....1....6....2....6....5....6....5....2....1....4....6....6....1....1....2 %e A263761 ..0....4....3....6....3....1....4....1....6....2....1....2....1....4....2....4 %e A263761 ..4....5....4....1....0....3....3....3....0....6....3....4....2....3....3....5 %e A263761 ..5....3....2....4....2....4....5....4....5....3....5....1....4....6....6....6 %Y A263761 Cf. A263764. %K A263761 nonn %O A263761 1,4 %A A263761 _R. H. Hardin_, Oct 25 2015