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 A263642 #4 Oct 22 2015 14:47:48 %S A263642 1,2,5,17,70,349,2017,13358,74678,335720,1500041,6440272,28038374, %T A263642 123298684,556103807,2564034001,11893926843,55032401086,253092976011, %U A263642 1160780168755,5299878003384,24174899648334,110233336977738 %N A263642 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 increases. %C A263642 Column 7 of A263643. %H A263642 R. H. Hardin, <a href="/A263642/b263642.txt">Table of n, a(n) for n = 1..210</a> %e A263642 Some solutions for n=6 %e A263642 ..4....1....5....1....5....5....3....5....2....1....1....2....4....4....2....2 %e A263642 ..5....0....3....5....1....0....4....1....3....4....4....5....0....2....1....5 %e A263642 ..3....4....2....4....2....4....2....4....1....2....3....4....3....5....5....3 %e A263642 ..2....3....0....3....0....1....5....0....4....0....0....3....1....3....0....4 %e A263642 ..1....5....4....2....4....3....0....3....0....5....5....0....5....1....4....0 %e A263642 ..0....2....1....0....3....2....1....2....5....3....2....1....2....0....3....1 %Y A263642 Cf. A263643. %K A263642 nonn %O A263642 1,2 %A A263642 _R. H. Hardin_, Oct 22 2015