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.

A187804 Number of circular permutations of length n whose n flattenings are all not derangements.

Original entry on oeis.org

1, 0, 3, 0, 19, 0, 0, 0
Offset: 3

Views

Author

Isaac Lambert, Jan 06 2013

Keywords

Comments

Circular permutations are permutations whose indices are from the ring of integers modulo n. For a circular permutation pi, a flattening at position k

Examples

			For n=5 the a(5)=3 solutions are (0,3,1,4,2), (0,4,3,2,1), and (0,2,4,1,3).

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

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