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 A263682 #4 Oct 23 2015 14:16:10 %S A263682 1,2,5,17,70,349,2017,13358,85403,514631,2892717,15496398,80361985, %T A263682 412478090,2110690179,10938840527,57413943808,304300790810, %U A263682 1621734608963,8661768091020,46243202420814,246483106624494,1310659258937117 %N A263682 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and with no two consecutive decreases. %C A263682 Column 7 of A263683. %H A263682 R. H. Hardin, <a href="/A263682/b263682.txt">Table of n, a(n) for n = 1..210</a> %e A263682 Some solutions for n=7 %e A263682 ..2....5....1....0....1....2....4....0....2....3....6....2....1....6....6....5 %e A263682 ..6....1....0....5....2....4....1....3....3....1....0....5....3....4....1....0 %e A263682 ..1....3....2....6....3....0....6....2....5....4....1....0....0....5....4....4 %e A263682 ..4....6....3....3....6....6....0....4....0....6....5....4....6....1....2....6 %e A263682 ..3....2....4....4....4....1....2....6....1....0....3....1....2....2....5....1 %e A263682 ..5....4....5....1....5....3....5....1....4....2....4....6....5....3....0....2 %e A263682 ..0....0....6....2....0....5....3....5....6....5....2....3....4....0....3....3 %Y A263682 Cf. A263683. %K A263682 nonn %O A263682 1,2 %A A263682 _R. H. Hardin_, Oct 23 2015