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 A263640 #4 Oct 22 2015 14:46:32 %S A263640 1,2,5,17,70,349,1389,4255,13529,42700,141128,479893,1639260,5542549, %T A263640 18548087,62017274,207179998,694864003,2330691027,7821792735, %U A263640 26241990473,87992594947,295032591603,989183937210,3317043061446,11123439095051 %N A263640 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 increases. %C A263640 Column 5 of A263643. %H A263640 R. H. Hardin, <a href="/A263640/b263640.txt">Table of n, a(n) for n = 1..210</a> %e A263640 Some solutions for n=6 %e A263640 ..1....5....5....2....0....4....4....3....5....0....1....3....5....4....4....1 %e A263640 ..4....2....3....3....4....0....2....2....3....5....5....2....4....3....5....0 %e A263640 ..3....3....1....1....3....5....5....4....2....4....3....0....3....2....3....5 %e A263640 ..5....1....0....0....2....3....3....1....4....3....0....4....2....1....1....3 %e A263640 ..2....4....4....5....1....2....0....5....1....2....4....1....0....0....0....2 %e A263640 ..0....0....2....4....5....1....1....0....0....1....2....5....1....5....2....4 %Y A263640 Cf. A263643. %K A263640 nonn %O A263640 1,2 %A A263640 _R. H. Hardin_, Oct 22 2015