login
A235941
Positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.
6
0, 0, 0, 0, 25, 72, 539, 3968, 33048, 305600, 3124341, 34963488, 425424207, 5593859992, 79061218200, 1195472642048, 19259241768353, 329353196517576, 5959061652480611, 113737292614696800, 2283903379659326040
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) = n^2 * A235937(n).
a(n) = n * A235939(n).
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