cp's OEIS Frontend

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.

%I A235941 #17 Jan 05 2019 01:40:59
%S A235941 0,0,0,0,25,72,539,3968,33048,305600,3124341,34963488,425424207,
%T A235941 5593859992,79061218200,1195472642048,19259241768353,329353196517576,
%U A235941 5959061652480611,113737292614696800,2283903379659326040
%N 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.
%D A235941 Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences
%H A235941 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 A235941 a(n) = n^2 * A235937(n).
%F A235941 a(n) = n * A235939(n).
%Y A235941 Cf. A165961, A165964, A165962, A078628, A078673.
%Y A235941 Cf. A235937, A235938, A235939, A235940, A235942, A235943.
%K A235941 nonn
%O A235941 1,5
%A A235941 _Paul J. Campbell_, Jan 20 2014, with Joe Marasco and Ashish Vikram
%E A235941 a(20)-a(21) from _Alois P. Heinz_, Jan 24 2014
%E A235941 Obsolete b-file deleted by _N. J. A. Sloane_, Jan 05 2019