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

0, 0, 0, 0, 10, 24, 154, 992, 7344, 61120, 568062, 5827248, 65449878, 799122856, 10541495760, 149434080256, 2265793149218, 36594799613064, 627269647629538, 11373729261469680, 217514607586602480

Offset: 1

Author

Paul J. Campbell, Jan 20 2014, with Joe Marasco and Ashish Vikram

Keywords

• nonn
• more

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.

Crossrefs

Cf. A165961, A165964, A165962, A078628, A078673.

Cf. A235937, A235938, A235939, A235941, A235942, A235943.

Formula

a(n) = 2n*A235937(n).

a(n) = n*A235938(n).

a(n) = 2*A235939(n).

Extensions

a(20)-a(21) added using the data at A235939 by Amiram Eldar, May 06 2024