Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062992
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062992 Row sums of unsigned triangle A062991. +0
10
1, 3, 13, 67, 381, 2307, 14589, 95235, 636925, 4341763, 30056445, 210731011, 1493303293, 10678370307, 76957679613, 558403682307, 4075996839933, 29909606989827, 220510631755773, 1632599134961667, 12133359132082173 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n)=N(2; n,x=-1), with the polynomials N(2; n,x) defined in A062991.

FORMULA

a(n)=2*sum(((-1)^j)*C(n-j)*2^(n-j), j=0..n)-(-1)^n with C(n) := A000108(n) (Catalan).

G.f.: (2*c(2*x)-1)/(1+x) with c(x) g.f. of A000108.

a(n)=(1/(n+1))*sum{k=0..n, binomial(2n+2, n-k)*binomial(n+k, k)}; - Paul Barry (pbarry(AT)wit.ie), May 11 2005

Rewritten: a(n)= (1-2*c(n, -2))*(-1)^(n+1), n>=0, with c(n, x):=sum(C(k)*x^k, k=0..n) and C(k):=A000108(k) (Catalan). W. Lang Oct 31 2005.

PROGRAM

(PARI) a(n)=polcoeff((1-2*x-sqrt(1-8*x+x^2*O(x^n)))/(2*x+2*x^2), n)

(PARI) a(n)=if(n<0, 0, polcoeff(serreverse((x-x^2)/(1+x)^2+O(x^(n+2))), n+1)) (from R. Stephan)

CROSSREFS

Cf. A064062.

Cf. A112707 (c(n, -m) triangle). Here m=2 is used.

Sequence in context: A142979 A136784 A027277 this_sequence A064062 A114191 A107592

Adjacent sequences: A062989 A062990 A062991 this_sequence A062993 A062994 A062995

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Jul 12 2001

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research