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.

A078603 Number of ways of arranging the numbers 1..n in a circle so that adjacent numbers do not differ by 1 mod n.

Original entry on oeis.org

1, 0, 0, 0, 2, 6, 46, 354, 3106, 29926, 315862, 3628906, 45132474, 604534846, 8680957902, 133082437730, 2169964347282, 37505486702678, 685046187718022, 13186335387855770, 266816610979894058, 5662225862272325550
Offset: 1

Views

Author

N. J. A. Sloane, Dec 11 2002

Keywords

Examples

			a(5) = 2: 1 3 5 2 4, 1 4 2 5 3; a(6) = 6: 1 4 6 2 5 3, 1 5 2 4 6 3, 1 5 3 6 2 4, 1 3 6 4 2 5, 1 4 2 6 3 5, 1 3 5 2 6 4.
		

Crossrefs

Twice A002816.
The sequence n*a(n) is A089222.
See also A078628.

Formula

For n>1, a(n) = 2*A002816(n).

Extensions

The sequence was missing a zero; also added a cross-reference Joel B. Lewis, Jan 28 2010