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 A370686 #11 Feb 28 2024 08:48:39
%S A370686 1,1,1,3,5,7,17,31,49,107,201,339,699,1327,2327,4643,8843,15895,31099,
%T A370686 59251,108239,209239,398355,735619,1411351,2684147,4993111,9533775,
%U A370686 18112735,33863375,64457715,122348279,229537011,436029791,827012339,1555314327,2950532447,5592873575,10536068991
%N A370686 a(n) is the number of 132-avoiding permutations p so that p^3 is the identity permutation.
%C A370686 a(n) is the number of 132-avoiding permutations composed only of 3-cycles and fixed points.
%H A370686 Kassie Archer and Robert P. Laudone, <a href="https://arxiv.org/abs/2402.15463">Pattern-restricted permutations of small order</a>, arXiv:2402.15463 [math.CO], 2024.
%F A370686 G.f.: c(x^3)/(sqrt(c(x^3)*(4-3*c(x^3)))-x*c(x^3)) where c(x) is the generating function for the Catalan numbers.
%o A370686 (PARI) my(N=44,x='x+O('x^N),C(x)=(1-sqrt(1-4*x))/(2*x)); Vec(C(x^3)/(sqrt(C(x^3)*(4-3*C(x^3)))-x*C(x^3))) \\ _Joerg Arndt_, Feb 27 2024
%Y A370686 Cf. A000108, A309331.
%K A370686 nonn
%O A370686 0,4
%A A370686 _Kassie Archer_, Feb 26 2024