|
Search: id:A091964
|
|
|
| A091964 |
|
Number of left factors of peakless Motzkin paths of length n (i.e. number of paths from (0,0) to the line x=n, consisting of steps u=(1,1), h=(1,0), d=(1,1), that never go below the x-axis and a u step is never followed by a d step). |
|
+0
3
|
|
| 1, 2, 4, 9, 21, 50, 121, 296, 730, 1812, 4521, 11328, 28485, 71844, 181674, 460443, 1169283, 2974574, 7578937, 19337489, 49401526, 126350742, 323495259, 829033334, 2126454271, 5458711430, 14023219126, 36049991901, 92734505565
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Equals diagonal sums of triangle A124428. - Paul D. Hanna (pauldhanna(AT)juno.com), Oct 31 2006
|
|
REFERENCES
|
A. Nkwanta, Lattice paths and RNA secondary structures, DIMACS Series in Discrete Math. and Theoretical Computer Science, 34, 1997, 137-147.
|
|
FORMULA
|
G.f. = 2/[1-3z+z^2+sqrt(1-2z-z^2-2z^3+z^4)].
a(n) = Sum_{k=0..n} C(n-[k/2], [(k+1)/2]) * C(n-[(k+1)/2], [k/2]). - Paul D. Hanna (pauldhanna(AT)juno.com), Mar 24 2005
a(n) = Sum_{k=0..n} C([(n+k)/2],k)*C([(n+k+1)/2],k)). - Paul D. Hanna (pauldhanna(AT)juno.com), Oct 31 2006
|
|
EXAMPLE
|
a(2)=4 because we have hh, hu, uh, and uu.
|
|
PROGRAM
|
(PARI) a(n)=sum(k=0, n, binomial(n-k\2, (k+1)\2)*binomial(n-(k+1)\2, k\2)) (Hanna)
(PARI) a(n)=sum(k=0, n, binomial((n+k)\2, k)*binomial((n+k+1)\2, k)) - Paul D. Hanna (pauldhanna(AT)juno.com), Oct 31 2006
|
|
CROSSREFS
|
Cf. A004148.
Cf. A104559.
Cf. A124428.
Sequence in context: A018905 A024537 A027826 this_sequence A092423 A091600 A048285
Adjacent sequences: A091961 A091962 A091963 this_sequence A091965 A091966 A091967
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 13 2004
|
|
|
Search completed in 0.002 seconds
|
