A235940 - OEIS

%I #22 May 06 2024 01:44:28

%S 0,0,0,0,10,24,154,992,7344,61120,568062,5827248,65449878,799122856,

%T 10541495760,149434080256,2265793149218,36594799613064,

%U 627269647629538,11373729261469680,217514607586602480

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

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

%H Wayne M. Dymáček and Isaac Lambert, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL14/Dymacek/dymacek5.html">Circular permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2</a>, Journal of Integer Sequences, Vol. 14 (2011), Article 11.1.6.

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

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

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

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

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

%K nonn,more

%O 1,5

%A _Paul J. Campbell_, Jan 20 2014, with Joe Marasco and Ashish Vikram

%E a(20)-a(21) added using the data at A235939 by _Amiram Eldar_, May 06 2024