login
A174083
Number of circular permutations of length n with no consecutive triples (i, i+d, i+2d) (mod n) for all d.
3
4, 0, 40, 168, 1652, 9408, 117896, 1019260, 12737856, 140794368
OFFSET
4,1
COMMENTS
Circular permutations are permutations whose indices are from the ring of integers modulo n.
EXAMPLE
For n=5 since a(5)=0 all (5-1)! = 24 circular permutations of length 5 have some consecutive triple (i, i+d, i+2d) (mod 5). For example, the permutation (0,4,2,1,3) has a triple (1,3,0) with d=2. This is clearly a special case.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Isaac Lambert, Mar 15 2010
EXTENSIONS
a(10)-a(13) from Andrey Goder, Jul 03 2022
STATUS
approved