A235942 Number of positions (cyclic permutations) 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, 50, 144, 1078, 7936, 66096, 611200, 6248682, 69926976, 850848414, 11187719984, 158122436400, 2390945284096, 38518483536706, 658706393035152, 11918123304961222, 227474585229393600, 4567806759318652080

Offset

1,5

References

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

Links

Table of n, a(n) for n=1..21.

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) = 2*n^2 * A235937(n).

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

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

a(n) = n * A235940(n).

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

Crossrefs

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

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

Sequence in context: A044301 A044682 A200881 * A093300 A283392 A261343

Adjacent sequences: A235939 A235940 A235941 * A235943 A235944 A235945

Keyword

nonn

Author

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

Extensions

a(20)-a(21) from Alois P. Heinz, Jan 24 2014

Obsolete b-file deleted by N. J. A. Sloane, Jan 05 2019

Status

approved