|
Search: id:A166291
|
|
|
| A166291 |
|
Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k peaks at odd level (0<=k<=n; U=(1,1), D=(1,-1)). |
|
+0
4
|
|
| 1, 0, 1, 1, 0, 1, 1, 2, 0, 1, 2, 2, 3, 0, 1, 3, 6, 3, 4, 0, 1, 5, 10, 12, 4, 5, 0, 1, 8, 20, 22, 20, 5, 6, 0, 1, 13, 36, 52, 40, 30, 6, 7, 0, 1, 21, 66, 104, 109, 65, 42, 7, 8, 0, 1, 34, 118, 214, 240, 200, 98, 56, 8, 9, 0, 1, 55, 210, 421, 549, 481, 335, 140, 72, 9, 10, 0, 1, 89, 370
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
Sum of entries in row n = A004148(n+1) (the secondary structure numbers).
T(n,0)=A000045(n-1) (the Fibonacci numbers).
Sum(k*T(n,k), k=0..n)=A166292(n).
|
|
FORMULA
|
The trivariate g.f. G=G(t,s,z), where z marks semilength, t marks odd-level peaks and s marks even-level peaks, satisfies G = 1 + tzG + sz^2*G + s^2*z^3*HG, where H=G(s,t,z) (interchanging t and s and eliminating H, one obtains G(t,s,z); see the Maple program).
|
|
EXAMPLE
|
T(4,2)=3 because we have (UD)(UD)UUDD, (UD)UUDD(UD), and UUDD(UD)(UD) (the odd level peaks are shown between parentheses).
Triangle starts:
1;
0,1;
1,0,1;
1,2,0,1;
2,2,3,0,1;
3,6,3,4,0,1.
|
|
MAPLE
|
p1 := -G+1+t*z*G+s*z^2*G+s^2*z^3*H*G: p2 := subs({t = s, s = t, G = H, H = G}, p1): r := resultant(p1, p2, H): G := RootOf(subs(s = 1, r), G): Gser := simplify(series(G, z = 0, 15)): for n from 0 to 12 do P[n] := sort(coeff(Gser, z, n)) end do: for n from 0 to 12 do seq(coeff(P[n], t, j), j = 0 .. n) end do; yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A004148, A000045, A166292, A166293, A166294
Sequence in context: A058739 A128627 A105422 this_sequence A162986 A128584 A080099
Adjacent sequences: A166288 A166289 A166290 this_sequence A166292 A166293 A166294
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 12 2009
|
|
|
Search completed in 0.002 seconds
|
