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 A263763 #6 Jul 23 2025 15:38:00 %S A263763 0,0,1,4,31,146,1289,7736,68811,354568,2562282,12614090,80560052, %T A263763 406847624,2530379183,13576171696,85562497735,476311791218, %U A263763 2983359368303,16861046247216,104017882519889,591843352618090,3599197579892399 %N A263763 Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and exactly one more element moved upwards than downwards. %C A263763 Column 7 of A263764 %H A263763 R. H. Hardin, <a href="/A263763/b263763.txt">Table of n, a(n) for n = 1..45</a> %e A263763 Some solutions for n=7 %e A263763 ..0....4....1....3....3....3....6....4....2....2....2....6....5....6....6....6 %e A263763 ..1....6....5....6....6....5....5....3....0....5....6....5....0....4....0....0 %e A263763 ..2....0....6....5....5....2....1....6....3....0....0....0....2....1....2....4 %e A263763 ..6....1....2....2....2....0....4....1....6....6....5....3....4....3....3....1 %e A263763 ..3....5....3....0....1....1....0....0....1....3....1....4....3....2....4....5 %e A263763 ..5....2....4....1....4....4....3....2....4....1....4....2....1....5....5....3 %e A263763 ..4....3....0....4....0....6....2....5....5....4....3....1....6....0....1....2 %Y A263763 Cf. A263764 %K A263763 nonn %O A263763 1,4 %A A263763 _R. H. Hardin_, Oct 25 2015