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.

A067601 a(n) is the number of inequivalent permutations of {0..2n-1}, such that the first differences (modulo 2n) are a permutation of {1..2n-1}.

Table of values

n a(n)
1 1
2 1
3 2
4 12
5 144
6 1928
7 44664
8 1377984
9 51826560

List of values

[1, 1, 2, 12, 144, 1928, 44664, 1377984, 51826560]