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.

A036981 Number of (2n+1) X (2n+1) symmetric matrices each of whose rows is a permutation of 1..(2n+1).

Original entry on oeis.org

1, 6, 720, 31449600, 444733651353600, 10070314878246926155776000, 614972203951464612786852376432607232000
Offset: 0

Views

Author

Joshua Zucker and Joe Keane

Keywords

Comments

Number of different schedules for 2n+2 teams. - Andres Cardemil (andrescarde(AT)yahoo.com), Nov 28 2001

Crossrefs

Formula

a(n) = A000438(n+1) * (2*n+1)!.

Extensions

a(5)-a(6) computed from A000438 by Max Alekseyev, Jun 17 2011