2517303domain: NAppears in sequencesNumber of circular permutations with exactly one specified increasing or decreasing modular run (3-sequence), with clockwise and counterclockwise traversals not counted as distinct.at n=12A235937G.f. A(x) satisfies A(x) = 1 + x*A(x)^3/(1 - x)^2.at n=9A366176