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.

A007082 Number of Eulerian circuits on the complete graph K_{2n+1}, divided by (n-1)!^(2n+1).

Table of values

n a(n)
1 2
2 264
3 1015440
4 90449251200
5 169107043478365440
6 6267416821165079203599360
7 4435711276305905572695127676467200
8 58393052751308545653929138771580386824519680
9 14021772793551297695593332913856884153315254190271692800
10 60498832138791357698014788383803842810832836262245623803123983974400

List of values

[2, 264, 1015440, 90449251200, 169107043478365440, 6267416821165079203599360, 4435711276305905572695127676467200, 58393052751308545653929138771580386824519680, 14021772793551297695593332913856884153315254190271692800, 60498832138791357698014788383803842810832836262245623803123983974400]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.