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 A263784 #6 Jul 23 2025 15:38:29 %S A263784 0,0,0,1,5,66,267,1721,6618,35203,144762,741173,3224052,16013645, %T A263784 70410201,336946471,1484278684,6936580487,30771798007,142201264901, %U A263784 634570792805,2910183388216,13025117664481,59369311030590 %N A263784 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and exactly two more elements moved upwards than downwards. %C A263784 Column 5 of A263787 %H A263784 R. H. Hardin, <a href="/A263784/b263784.txt">Table of n, a(n) for n = 1..179</a> %e A263784 Some solutions for n=7 %e A263784 ..5....5....5....4....5....1....5....4....5....3....2....0....0....4....2....5 %e A263784 ..0....6....0....0....1....6....1....6....6....0....6....3....6....0....0....1 %e A263784 ..1....2....4....1....0....0....6....1....2....6....1....1....2....5....1....2 %e A263784 ..6....1....2....6....6....2....2....0....0....1....3....2....3....2....6....0 %e A263784 ..4....0....3....3....3....4....3....2....3....2....0....6....1....1....3....3 %e A263784 ..3....4....1....5....2....3....0....5....4....5....4....4....4....3....5....4 %e A263784 ..2....3....6....2....4....5....4....3....1....4....5....5....5....6....4....6 %Y A263784 Cf. A263787 %K A263784 nonn %O A263784 1,5 %A A263784 _R. H. Hardin_, Oct 26 2015