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 A263641 #4 Oct 22 2015 14:47:09 %S A263641 1,2,5,17,70,349,2017,9673,36321,138420,511748,1952716,7596839, %T A263641 30518737,122761971,492354214,1954807815,7749597167,30587342598, %U A263641 120939248751,478688493595,1897205025687,7520593309740,29825363773570,118218233684104 %N A263641 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive increases. %C A263641 Column 6 of A263643. %H A263641 R. H. Hardin, <a href="/A263641/b263641.txt">Table of n, a(n) for n = 1..210</a> %e A263641 Some solutions for n=6 %e A263641 ..5....5....5....0....2....4....3....5....1....4....2....1....1....4....2....5 %e A263641 ..2....4....3....5....4....5....4....1....5....3....5....5....5....0....3....0 %e A263641 ..3....2....0....2....0....1....0....4....4....1....4....0....3....5....1....3 %e A263641 ..1....0....2....4....3....3....2....2....3....2....3....4....4....1....4....1 %e A263641 ..4....3....1....1....1....0....1....3....0....0....0....3....2....3....0....4 %e A263641 ..0....1....4....3....5....2....5....0....2....5....1....2....0....2....5....2 %Y A263641 Cf. A263643. %K A263641 nonn %O A263641 1,2 %A A263641 _R. H. Hardin_, Oct 22 2015