

A235939


Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3sequence, with clockwise and counterclockwise traversals not counted as distinct.


6



0, 0, 0, 0, 5, 12, 77, 496, 3672, 30560, 284031, 2913624, 32724939, 399561428, 5270747880, 74717040128, 1132896574609, 18297399806532, 313634823814769, 5686864630734840, 108757303793301240
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


COMMENTS

Arrangements that differ only in the direction in which the cycle is traversed do not count as different.


REFERENCES

Paul J. Campbell, Circular permutations with exactly one modular run (3sequence), submitted to Journal of Integer Sequences


LINKS



FORMULA



EXAMPLE

a(5) = 5: 12354, 23415, 34521, 45132, 51243.


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



