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 A263680 #4 Oct 23 2015 14:14:53 %S A263680 1,2,5,17,70,349,1658,7356,30374,121676,479589,1917853,7777174, %T A263680 31840851,130793340,537219555,2200344721,8992050521,36701192008, %U A263680 149773458903,611384304706,2496957012448,10201222295479,41681902590078 %N A263680 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and with no two consecutive decreases. %C A263680 Column 5 of A263683. %H A263680 R. H. Hardin, <a href="/A263680/b263680.txt">Table of n, a(n) for n = 1..210</a> %e A263680 Some solutions for n=7 %e A263680 ..0....4....3....5....0....5....2....0....4....2....0....2....4....2....3....5 %e A263680 ..3....0....0....0....3....1....3....4....5....3....2....3....6....5....5....1 %e A263680 ..6....5....2....3....4....2....0....1....6....5....4....0....0....6....0....4 %e A263680 ..4....2....1....6....1....6....5....2....0....0....1....5....5....0....1....0 %e A263680 ..5....6....6....1....2....0....1....5....1....1....3....1....2....3....6....3 %e A263680 ..1....1....4....2....5....4....6....3....2....4....5....4....3....4....2....6 %e A263680 ..2....3....5....4....6....3....4....6....3....6....6....6....1....1....4....2 %Y A263680 Cf. A263683. %K A263680 nonn %O A263680 1,2 %A A263680 _R. H. Hardin_, Oct 23 2015