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 A263741 #6 Jul 23 2025 15:36:37 %S A263741 1,2,4,14,46,282,1118,5962,21974,100324,384813,1770579,7304326, %T A263741 33789034,142823462,650681108,2776615816,12494221594,53928255898, %U A263741 241817051980,1054482471250,4720387107791,20718599970171,92576815674458 %N A263741 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and equal numbers of elements moved upwards and downwards. %C A263741 Column 5 of A263744 %H A263741 R. H. Hardin, <a href="/A263741/b263741.txt">Table of n, a(n) for n = 1..178</a> %e A263741 Some solutions for n=7 %e A263741 ..3....4....2....1....0....0....3....5....1....3....2....2....4....1....2....2 %e A263741 ..6....5....5....3....1....4....0....2....5....1....6....6....3....0....1....0 %e A263741 ..5....1....6....0....4....3....2....0....2....0....4....1....0....2....0....6 %e A263741 ..2....3....0....6....6....2....5....6....0....5....0....3....6....5....4....3 %e A263741 ..4....0....4....2....3....1....6....4....4....6....3....5....2....6....6....5 %e A263741 ..0....6....3....5....5....6....1....3....3....4....5....0....5....4....3....1 %e A263741 ..1....2....1....4....2....5....4....1....6....2....1....4....1....3....5....4 %Y A263741 Cf. A263744 %K A263741 nonn %O A263741 1,2 %A A263741 _R. H. Hardin_, Oct 25 2015