Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050165
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050165 T(n,k)=M(2n+1,k,-1), 0<=k<=n, n >= 0, array M as in A050144. +0
4
1, 1, 1, 1, 3, 2, 1, 5, 9, 5, 1, 7, 20, 28, 14, 1, 9, 35, 75, 90, 42, 1, 11, 54, 154, 275, 297, 132, 1, 13, 77, 273, 637, 1001, 1001, 429, 1, 15, 104, 440, 1260, 2548, 3640, 3432, 1430, 1, 17, 135, 663, 2244, 5508, 9996, 13260, 11934 (list; table; graph; listen)
OFFSET

0,5

COMMENT

T is a mirror image of the array in A039599.

FORMULA

Triangle T(n, k) read by rows; given by [1, 0, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 1, 1, 1, 1, 1, 1, 1, 1, ...] where DELTA is the operator defined in A084938. T(n, k) = C(2n, k)*(2n-2k+1)/(2n-k+1) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Dec 07 2003

Sum_{k=0 ..inf(m, n)} T(m, m-k)*T(n, n-k)= A000108(m+n); A000108: Catalan numbers. - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Dec 30 2003

T(n, k) = 0 if n<k, T(n, n)= A000108(n) and for n>k : T(n, k) = Sum_{j=0..k} T(n-1-j, k-j)*A000108(j+1) . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 03 2004

T(n,k)= Sum_{j, j>=0} (-1)^(n-j)*A094385(n,j)*binomial(j,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), May 05 2007

EXAMPLE

Rows: {1}; {1,1}; {1,3,2}; ...

CROSSREFS

Cf. A084938.

Sequence in context: A077976 A021912 A114597 this_sequence A033878 A144061 A085792

Adjacent sequences: A050162 A050163 A050164 this_sequence A050166 A050167 A050168

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research