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.

A263898 Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and the total absolute value of displacements not greater than 2*(n-1).

This page as a plain text file.
%I A263898 #18 Jan 16 2025 02:29:58
%S A263898 1,2,6,20,76,300,1252,5324,23124,101548,450320,2010108,9022704,
%T A263898 40674180,184026168,835121676,3799670208,17326530900,79163726536,
%U A263898 362316871964,1660794058176,7623209945860,35034482102360,161190157871724,742373773430192,3422236265162068
%N A263898 Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and the total absolute value of displacements not greater than 2*(n-1).
%H A263898 Seiichi Manyama, <a href="/A263898/b263898.txt">Table of n, a(n) for n = 1..500</a> (terms 1..141 from Alois P. Heinz)
%e A263898 Some solutions for n=7:
%e A263898 ..0....2....4....4....2....4....1....0....5....2....3....0....1....0....0....3
%e A263898 ..1....1....2....3....5....2....2....1....1....1....2....1....2....1....6....2
%e A263898 ..2....5....3....1....1....1....0....3....0....0....1....4....4....5....2....0
%e A263898 ..3....0....0....2....0....0....5....6....3....6....4....5....0....6....4....4
%e A263898 ..6....3....1....0....3....3....4....4....4....4....0....2....5....4....3....1
%e A263898 ..4....4....5....5....4....5....6....5....2....5....5....3....6....2....5....6
%e A263898 ..5....6....6....6....6....6....3....2....6....3....6....6....3....3....1....5
%Y A263898 Diagonal of A263905.
%Y A263898 Row sums of A357329.
%Y A263898 Cf. A263905.
%K A263898 nonn
%O A263898 1,2
%A A263898 _R. H. Hardin_, Oct 29 2015
%E A263898 a(21)-a(26) from _Alois P. Heinz_, Oct 01 2022