|
Search: id:A010736
|
|
|
| A010736 |
|
Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-2,n). |
|
+0
2
|
|
| 1, 3, 12, 52, 237, 1119, 5424, 26832, 134913, 687443, 3541932, 18421524, 96585597, 509960223, 2709067968, 14469453632, 77655751329, 418567792899, 2264867271852, 12298297439892, 66993811842477, 366009125766463
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Threefold convolution of A001003 with itself. Number of dissections of a convex polygon with n+4 sides that have a quadrilateral over a fixed side (the base) of the polygon. Example: a(1)=3 because the only dissections of the convex pentagon ABCDE (AB being the base), that have a quadrilateral over AB are the dissections made by the diagonals EC, AD, and BD, respectively. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 27 2003
a(n-1) = number of royal paths (A006318) from (0,0) to (n,n) with exactly 2 diagonal steps on the line y=x. - David Callan (callan(AT)stat.wisc.edu), Jul 15 2004
|
|
FORMULA
|
G.f.=[1+z-sqrt(1-6*z+z^2)]^3/(64z^3). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 27 2003
a(n) = (3/n)*sum(binomial(n, k)*binomial(n+k+2, k-1), k=1..n) = 3*hypergeom([1-n, n+4], [2], -1), n>=1, a(0)=1.
|
|
MATHEMATICA
|
f[ x_, y_ ] := f[ x, y ] = Module[ {return}, If[ x == 0, return = 1, If[ y == x-1, return = 0, return = f[ x, y-1 ] + Sum[ f[ k, y ], {k, 0, x-1} ] ] ]; return ]; Do[ Print[ Table[ f[ k, j ], {k, 0, j} ] ], {j, 10, 0, -1} ]
|
|
CROSSREFS
|
Cf. A001003.
Right-hand column 3 of triangle A011117.
Third column of convolution triangle A011117.
Sequence in context: A064036 A125187 A007856 this_sequence A007198 A000256 A124202
Adjacent sequences: A010733 A010734 A010735 this_sequence A010737 A010738 A010739
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert Sulanke (sulanke(AT)diamond.idbsu.edu)
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 27 2003
|
|
|
Search completed in 0.005 seconds
|
