Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039797 Triangle of numbers of Dyck paths. +0
2
1, 1, 1, 3, 3, 1, 14, 14, 6, 1, 84, 84, 40, 10, 1, 594, 594, 300, 90, 15, 1, 4719, 4719, 2475, 825, 175, 21, 1, 40898, 40898, 22022, 7865, 1925, 308, 28, 1, 379236, 379236, 208208, 78078, 21021, 4004, 504, 36, 1, 3711916, 3711916, 2068560, 804440, 231868, 49686 (list; table; graph; listen)
OFFSET

0,4

REFERENCES

D. Gouyou-Beauchamps, Chemins sous-diagonaux et tableau de Young, pp. 112-125 of "Combinatoire Enumerative (Montreal 1985)", Lect. Notes Math. 1234, 1986.

LINKS

Index entries for sequences related to Young tableaux.

FORMULA

T(n, k)=(2n-k)!(2n-k+2)!(k+3)!/[(n-k)!(n-k+1)!k!(n+2)!(n+3)! ] for 0<=k<=n. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

MAPLE

T:=(n, k)->(2*n-k)!*(2*n-k+2)!*(k+3)!/(n-k)!/(n-k+1)!/k!/(n+2)!/(n+3)!: seq(seq(T(n, k), k=0..n), n=0..10);

CROSSREFS

Reflection of A039798.

Sequence in context: A094021 A062746 A115193 this_sequence A112292 A001497 A123244

Adjacent sequences: A039794 A039795 A039796 this_sequence A039798 A039799 A039800

KEYWORD

nonn,tabl,easy,nice

AUTHOR

njas

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research