login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004310 Binomial coefficient C(2n,n-4). 2
1, 10, 66, 364, 1820, 8568, 38760, 170544, 735471, 3124550, 13123110, 54627300, 225792840, 927983760, 3796297200, 15471286560, 62852101650, 254661927156, 1029530696964, 4154246671960, 16735679449896 (list; graph; refs; listen; history; internal format)
OFFSET

4,2

COMMENTS

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].

PROG

(MAGMA) [ Binomial(2*n, n-4): n in [4..150] ]; // Vincenzo Librandi, Apr 13 2011

CROSSREFS

Diagonal 9 of triangle A100257.

Sequence in context: A024391 A074362 A080421 * A026853 A177452 A033504

Adjacent sequences:  A004307 A004308 A004309 * A004311 A004312 A004313

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:21 EST 2012. Contains 205785 sequences.