Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,5

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

EXAMPLE

1; 1,1; 1,3,3; 1,6,14,14; ...

MAPLE

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

CROSSREFS

Cf. A039797.

Reflection of A039797.

Sequence in context: A110640 A143389 A094040 this_sequence A001498 A138464 A117279

Adjacent sequences: A039795 A039796 A039797 this_sequence A039799 A039800 A039801

KEYWORD

nonn,tabl,easy,nice

AUTHOR

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

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research