Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116363
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116363 a(n) = dot product of row n in Catalan triangle A033184 with row n in Pascal's triangle. +0
2
1, 2, 7, 30, 141, 698, 3571, 18686, 99385, 535122, 2908863, 15932766, 87809541, 486421770, 2706138987, 15110359038, 84637982961, 475381503266, 2676447372535, 15100548901790, 85357620588541, 483304834607322 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = Sum_{k=0..n} C(n,k)*C(2*n-k+1,n-k)*(k+1)/(2*n-k+1). G.f. satisfies: d/dx[log(1-4*x*A(x))] = -4*(1-5*x)/(1-13*x+43*x^2-7*x^3).

EXAMPLE

The dot product of Catalan row 4 and Pascal row 4 equals

a(4) = [14,14,9,4,1]*[1,4,6,4,1] = 141

which is equivalent to obtaining the final term

in these repeated partial sums of Pascal row 4:

1,4, 6, 4, 1

.5,11,15,16

..16,31,47

...47,94

....141

PROGRAM

(PARI) a(n)=sum(k=0, n, binomial(n, k)*binomial(2*n-k+1, n-k)*(k+1)/(2*n-k+1))

CROSSREFS

Cf. A033184.

Sequence in context: A074416 A097924 A027136 this_sequence A046648 A006013 A059578

Adjacent sequences: A116360 A116361 A116362 this_sequence A116364 A116365 A116366

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Feb 04 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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research