This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A235940 #22 May 06 2024 01:44:28 %S A235940 0,0,0,0,10,24,154,992,7344,61120,568062,5827248,65449878,799122856, %T A235940 10541495760,149434080256,2265793149218,36594799613064, %U A235940 627269647629538,11373729261469680,217514607586602480 %N A235940 Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct. %D A235940 Paul J. Campbell, Circular permutations with exactly one modular run (3-sequence), submitted to Journal of Integer Sequences. %H A235940 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 A235940 a(n) = 2n*A235937(n). %F A235940 a(n) = n*A235938(n). %F A235940 a(n) = 2*A235939(n). %Y A235940 Cf. A165961, A165964, A165962, A078628, A078673. %Y A235940 Cf. A235937, A235938, A235939, A235941, A235942, A235943. %K A235940 nonn,more %O A235940 1,5 %A A235940 _Paul J. Campbell_, Jan 20 2014, with Joe Marasco and Ashish Vikram %E A235940 a(20)-a(21) added using the data at A235939 by _Amiram Eldar_, May 06 2024