login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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).
3
12, 84, 494, 3696, 30574
OFFSET
5,1
COMMENTS
Circular permutations are permutations whose indices are from the ring of integers modulo n.
EXAMPLE
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
KEYWORD
nonn
AUTHOR
Isaac Lambert, Mar 10 2010
STATUS
approved