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 A263596 #4 Oct 22 2015 12:44:00 %S A263596 1,2,6,16,52,208,800,3360,14024,55492,223040,900728,3560916,14099980, %T A263596 56141676,222623336,881949584,3502057736,13900013276,55132695636, %U A263596 218842222824,868762179984,3447429959044,13682419728976,54311665765692 %N A263596 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the median of every three consecutive elements nondecreasing. %C A263596 Column 7 of A263597. %H A263596 R. H. Hardin, <a href="/A263596/b263596.txt">Table of n, a(n) for n = 1..210</a> %e A263596 Some solutions for n=6 %e A263596 ..3....1....2....0....1....1....0....0....5....5....1....3....5....0....1....5 %e A263596 ..0....0....1....5....2....0....1....1....1....0....0....0....1....1....0....0 %e A263596 ..2....3....0....1....3....3....2....3....2....1....4....1....0....3....3....1 %e A263596 ..4....4....5....3....4....5....4....5....4....3....2....4....3....2....4....4 %e A263596 ..1....2....4....4....5....4....3....2....0....4....3....5....4....5....5....2 %e A263596 ..5....5....3....2....0....2....5....4....3....2....5....2....2....4....2....3 %Y A263596 Cf. A263597. %K A263596 nonn %O A263596 1,2 %A A263596 _R. H. Hardin_, Oct 22 2015