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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121724 Generalized central binomial coefficients for k=2. 5
1, 1, 5, 9, 45, 97, 485, 1145, 5725, 14289, 71445, 185193, 925965, 2467137, 12335685, 33563481, 167817405, 464221105, 2321105525, 6507351113, 32536755565 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Hankel transform is 4^binomial(n+1,2)=A053763(n+1). Case k=2 of T(n,k)=2*k^2*(2k)^n*INT(x^n*sqrt(1-x^2)/(1+k^2-2kx),x,-1,1)/pi. T(n,k) has Hankel transform (k^2)^binomial(n+1,2). k=1 corresponds to C(n,floor(n/2)).

Series reversion of x(1+x)/(1+2x+5x^2).

FORMULA

G.f.: (sqrt(1-16x^2)+2x-1)/(2x(1-5x))=c(4x^2)/(1-xc(4x^2)), c(x) the g.f. of A000108; a(n)=(1/(n+1))sum{k=0..n+1, sum{j=0..k, C(n,k)C(k,j)C(2n-2k+j,n-2k+j)(-1)^(n-2k+j)*2^j*5^(k-j)}};.

a(n)=8*4^n*INT(x^n*sqrt(1-x^2)/(5-4x),x,-1,1)/pi

a(n) = Sum_{k, 0<=k<=floor(n/2)} A009766(n-k,k)*2^2k . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 18 2006

a(n)=Sum_{k, 0<=k<=n}4^(n-k)*A120730(n,k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 16 2008]

CROSSREFS

Sequence in context: A176751 A123822 A145031 * A149496 A149497 A149498

Adjacent sequences:  A121721 A121722 A121723 * A121725 A121726 A121727

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Aug 17 2006, Feb 28 2007

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 14 17:10 EST 2012. Contains 205644 sequences.