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.

A320333 a(n) is the number of pairings of the first 2*k positive integers into k pairs (xi, yi) such that the k numbers (xi + yi) mod k are all different where k = 2*n + 1.

Table of values

n a(n)
0 1
1 9
2 145
3 4641
4 231417
5 16770369
6 1671395713

List of values

[1, 9, 145, 4641, 231417, 16770369, 1671395713]

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

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