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 A263783 #6 Jul 23 2025 15:38:24 %S A263783 0,0,0,1,5,37,116,572,2042,9298,35064,149613,562785,2272083,8551255, %T A263783 33698121,127422730,495208463,1874278884,7209869659,27281399998, %U A263783 104270642849,394494583551,1501695837844,5679621795233,21560364546542 %N A263783 Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and exactly two more elements moved upwards than downwards. %C A263783 Column 4 of A263787 %H A263783 R. H. Hardin, <a href="/A263783/b263783.txt">Table of n, a(n) for n = 1..210</a> %e A263783 Some solutions for n=7 %e A263783 ..4....4....0....4....0....3....3....4....3....0....0....0....3....3....3....3 %e A263783 ..0....0....2....0....4....0....1....0....5....3....5....3....0....0....1....0 %e A263783 ..5....1....6....5....6....2....6....1....1....6....6....6....1....5....0....1 %e A263783 ..1....5....1....1....2....6....0....3....0....1....2....2....6....2....2....5 %e A263783 ..2....3....3....3....3....1....2....2....2....2....1....1....2....1....6....2 %e A263783 ..3....2....4....2....1....4....4....6....4....4....4....4....5....4....4....4 %e A263783 ..6....6....5....6....5....5....5....5....6....5....3....5....4....6....5....6 %Y A263783 Cf. A263787 %K A263783 nonn %O A263783 1,5 %A A263783 _R. H. Hardin_, Oct 26 2015