cp's OEIS Frontend

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.

A263762 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and exactly one more element moved upwards than downwards.

This page as a plain text file.
%I A263762 #6 Jul 23 2025 15:37:55
%S A263762 0,0,1,4,31,146,1289,6152,41747,181272,1029204,4541726,24695797,
%T A263762 116559212,642871583,3152492440,17219444286,85580720364,459088917466,
%U A263762 2296809945900,12164522824153,61405250721512,323474064711527
%N A263762 Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and exactly one more element moved upwards than downwards.
%C A263762 Column 6 of A263764
%H A263762 R. H. Hardin, <a href="/A263762/b263762.txt">Table of n, a(n) for n = 1..96</a>
%e A263762 Some solutions for n=7
%e A263762 ..5....0....6....4....0....1....0....5....4....6....6....5....2....1....0....0
%e A263762 ..0....5....0....6....4....5....6....0....0....1....5....0....5....0....2....3
%e A263762 ..4....2....2....2....2....0....2....6....2....2....3....4....0....5....5....1
%e A263762 ..3....1....3....3....6....3....1....4....6....0....1....6....1....3....1....2
%e A263762 ..1....3....4....0....3....2....5....1....3....5....2....2....3....2....3....6
%e A263762 ..2....6....5....1....1....4....3....2....5....4....0....3....6....4....4....5
%e A263762 ..6....4....1....5....5....6....4....3....1....3....4....1....4....6....6....4
%Y A263762 Cf. A263764
%K A263762 nonn
%O A263762 1,4
%A A263762 _R. H. Hardin_, Oct 25 2015