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.

A174079 Number of circular permutations of length n with no consecutive triples i,i+2,i+4 (mod n) or i,i-2,i-4 (mod n).

Original entry on oeis.org

12, 84, 494, 3696, 30574
Offset: 5

Views

Author

Isaac Lambert, Mar 10 2010

Keywords

Comments

Circular permutations are permutations whose indices are from the ring of integers modulo n.

Examples

			For n=5 there are (5-1)!-a(5)=12 circular permutations with triples i,i+2,i+4 (mod 5) or triples i,i-2,i-4 (mod 5). An example of one is (0,3,1,2,4) because of the progression 0,3,1 (mod 5).
		

Crossrefs