OFFSET
0,7
COMMENTS
For "secondary structure" and "stack" see the Hofacker et al. reference, p. 209.
Sum of entries in row n is A202850(n).
From Sergey Kitaev, Nov 18 2023: (Start)
Number of permutations of length n avoiding simultaneously the patterns 132 and 321 with k descents (k>=0). A descent in a permutation a(1)a(2)...a(n) is position i such that a(i)>a(i+1).
Number of permutations of length n avoiding simultaneously the patterns 132 and 321 with k left-to-right minima (k>=1). A left-to-right minimum in a permutation a(1)a(2)...a(n) is position i such that a(j)>a(i) for all j<i. (End)
LINKS
Tian Han and Sergey Kitaev, Joint distributions of statistics over permutations avoiding two patterns of length 3, arXiv:2311.02974 [math.CO], 2023.
I. L. Hofacker, P. Schuster, and P. F. Stadler, Combinatorics of RNA secondary structures, Discrete Appl. Math., 88, 1998, 207-237.
P. R. Stein and M. S. Waterman, On some new sequences generalizing the Catalan and Motzkin numbers, Discrete Math., 26 (1979), 261-272.
FORMULA
G.f. G(t,z) satisfies G = 1 + zG + [tz^2/(1 + tz^2)]G(G-1).
The multivariate g.f. H(z, t[1], t[2], ...) of secondary structures with respect to size (marked by z) and number of stacks of length j (marked by t[j]) satisfies H = 1 + zH + (f/(1 + f))H(H-1), where f = t[1]z^2 + t[2]z^4 + t[3]z^6 + ... .
From Sergey Kitaev, Nov 18 2023: (Start)
G.f.: (1 - 2*x + x^2 + q*x^2)/(1 - x)^3, where x records length and q records descents.
G.f.: (1-3*x+s*x+3*x^2-2*s*x^2+s^2*x^2-x^3+s*x^3)/(1-x)^3, where x records length and s records left-to-right minima. (End)
EXAMPLE
Row 5 is 1,6: representing unpaired vertices by v and arcs by AA, BB, etc., the 7 (= A202850(5)) secondary structures of size 5 and with no stacks of length >=2 are vvvvv, AvAvv, vvAvA, AvvAv, vAvvA, AvvvA, vAvAv; with the exception of the first one, they all have 1 stack of length 1.
Triangle starts:
1;
1;
1;
1,1;
1,3;
1,6;
1,10,3;
1,15,14;
MAPLE
eq := G = 1+z*G+t*z^2*G*(G-1)/(1+t*z^2): G := RootOf(eq, G): Gser := simplify(series(G, z = 0, 22)): for n from 0 to 17 do P[n] := sort(coeff(Gser, z, n)) end do: for n from 0 to 17 do seq(coeff(P[n], t, k), k = 0 .. degree(P[n])) end do; # yields sequence in triangular form
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Dec 27 2011
STATUS
approved