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”).

A235940
Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct.
6
0, 0, 0, 0, 10, 24, 154, 992, 7344, 61120, 568062, 5827248, 65449878, 799122856, 10541495760, 149434080256, 2265793149218, 36594799613064, 627269647629538, 11373729261469680, 217514607586602480
OFFSET
1,5
REFERENCES
Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences.
LINKS
Wayne M. Dymáček and Isaac Lambert, Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2, Journal of Integer Sequences, Vol. 14 (2011), Article 11.1.6.
FORMULA
a(n) = 2n*A235937(n).
a(n) = n*A235938(n).
a(n) = 2*A235939(n).
KEYWORD
nonn,more
AUTHOR
Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram
EXTENSIONS
a(20)-a(21) added using the data at A235939 by Amiram Eldar, May 06 2024
STATUS
approved