242802domain: NAppears in sequencesa(n) = n*(n+1)*(2*n+1)*(n^2+n+3)/30.at n=20A061927Number 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=11A235937