|
Search: id:A003516
|
|
|
| A003516 |
|
Binomial coefficients C(2n+1,n-2).
(Formerly M4417)
|
|
+0
9
|
|
| 1, 7, 36, 165, 715, 3003, 12376, 50388, 203490, 817190, 3268760, 13037895, 51895935, 206253075, 818809200, 3247943160, 12875774670, 51021117810
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
a(n) = number of royal paths (A006318) from (0,0) to (n,n) with exactly one diagonal step off the line y=x. - David Callan (callan(AT)stat.wisc.edu), Mar 25 2004
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
|
|
MAPLE
|
seq((count(Composition(2*n), size=n-2)), n=3..28); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 03 2007
|
|
CROSSREFS
|
Diagonal 6 of triangle A100257.
Sequence in context: A026018 A085354 A051198 this_sequence A095931 A026856 A038748
Adjacent sequences: A003513 A003514 A003515 this_sequence A003517 A003518 A003519
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
