login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062992 Row sums of unsigned triangle A062991. 9
1, 3, 13, 67, 381, 2307, 14589, 95235, 636925, 4341763, 30056445, 210731011, 1493303293, 10678370307, 76957679613, 558403682307, 4075996839933, 29909606989827, 220510631755773, 1632599134961667, 12133359132082173 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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.

PROG

(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: A027277 A200754 * A064062 A114191 A107592 A028418

Adjacent sequences:  A062989 A062990 A062991 * A062993 A062994 A062995

KEYWORD

nonn,easy

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.