Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118919
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118919 Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross downwards the x-axis k times. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)). +0
5
1, 2, 5, 1, 14, 6, 42, 27, 1, 132, 110, 10, 429, 429, 65, 1, 1430, 1638, 350, 14, 4862, 6188, 1700, 119, 1, 16796, 23256, 7752, 798, 18, 58786, 87210, 33915, 4655, 189, 1, 208012, 326876, 144210, 24794, 1518, 22, 742900, 1225785, 600875, 123970, 10350 (list; graph; listen)
OFFSET

0,2

COMMENT

Row n contains 1+floor(n/2) terms. Row sums are the central binomial coefficients (A000984). T(n,0)=A000108(n+1) (the Catalan numbers). T(n,1)=A003517(n). T(n,2)=A003519(n). Sum(k*T(n,k),k>=0)=A008549(n-1). For both downward and upward crossings, see A118920.

Eigenvector is defined by: A119243(n) = Sum_{k=0..[n\2]} T(n,k)*A119243(k). This triangle is closely related to triangle A119245. - Paul D. Hanna (pauldhanna(AT)juno.com), May 10 2006

FORMULA

T(n,k)=(2k+1)binomial(2n+2,n-2k)/(n+1). G.f.=G(t,z)=C^2/(1-tz^2*C^4), where C=[1-sqrt(1-4z)]/(2z) is the Catalan function.

EXAMPLE

T(3,1)=6 because we have ud\dudu,ud\dduu,udud\du,uudd\du,ud\duud, and duud\du (the downward crossings of the x-axis are shown by a back-slash \).

Triangle starts:

1;

2;

5,1;

14,6;

42,27,1;

132,110,10;

MAPLE

T:=(n, k)->(2*k+1)*binomial(2*n+2, n-2*k)/(n+1): for n from 0 to 13 do seq(T(n, k), k=0..floor(n/2)) od; # yields sequence in triangular form

PROGRAM

(PARI) T(n, k)=if(n<2*k|k<0, 0, (2*k+1)*binomial(2*n+2, n-2*k)/(n+1)) - Paul D. Hanna (pauldhanna(AT)juno.com), May 10 2006

CROSSREFS

Cf. A000984, A000108, A003517, A003519, A008549, A118920.

Cf. A119243 (eigenvector), A119245 (variant).

Sequence in context: A118964 A073187 A138159 this_sequence A101282 A101895 A110220

Adjacent sequences: A118916 A118917 A118918 this_sequence A118920 A118921 A118922

KEYWORD

nonn,tabf

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), May 06 2006

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 August 28 22:44 EDT 2008. Contains 143251 sequences.


AT&T Labs Research