|
Search: id:A004310
|
|
|
| A004310 |
|
Binomial coefficient C(2n,n-4). |
|
+0
3
|
|
| 1, 10, 66, 364, 1820, 8568, 38760, 170544, 735471, 3124550, 13123110, 54627300, 225792840, 927983760, 3796297200, 15471286560, 62852101650, 254661927156, 1029530696964, 4154246671960, 16735679449896
(list; graph; listen)
|
|
|
OFFSET
|
4,2
|
|
|
COMMENT
|
Number of lattice paths from (0,0) to (n,n) with steps E=(1,0) and N=(0,1) which touch or cross the line x-y=4. - Herbert Kociemba (kociemba(AT)t-online.de), May 23 2004
|
|
REFERENCES
|
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].
|
|
CROSSREFS
|
Diagonal 9 of triangle A100257.
Sequence in context: A024391 A074362 A080421 this_sequence A026853 A033504 A163615
Adjacent sequences: A004307 A004308 A004309 this_sequence A004311 A004312 A004313
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
