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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100067 Sum binomial(n,k)2^(n-2k), k=0..floor(n/2). 3
1, 2, 6, 14, 38, 92, 240, 590, 1510, 3740, 9476, 23564, 59372, 147968, 371636, 927374, 2324870, 5805740, 14538660, 36322340, 90898228, 227153192, 568235696, 1420236524, 3551943388, 8878506392, 22201466280, 55498465400, 138766221800 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

An inverse Chebyshev transform of x/(1-2x), where the Chebyshev transform of g(x) is ((1-x^2)/(1+x^2))g(x/(1+x^2)) and the inverse transform maps a g.f. A(x) to (1/sqrt(1-4x^2))A(xc(x^2)) where c(x) is the g.f. of the Catalan numbers A000108. In general, sum{k=0..floor(n/2), binomial(n,k)r^(n-k)} has g.f. 2x/((sqrt(1-4x^2)(r*sqrt(1-4x^2)+r*x-r).

Hankel transform is A088138(n+1). [From Paul Barry (pbarry(AT)wit.ie), Jun 16 2009]

FORMULA

G.f.: x/((sqrt(1-4x^2)(sqrt(1-4x^2)+x-1); a(n)=sum{k=0..floor(n/2), binomial(n, k)2^(n-2k)}; a(n)=sum{k=0..n, binomial(n, (n-k)/2)(1+(-1)^(n-k)2^k/2}.

CROSSREFS

Cf. A027306, A100068, A100069.

Sequence in context: A026598 A006864 A071636 * A026597 A122112 A190788

Adjacent sequences:  A100064 A100065 A100066 * A100068 A100069 A100070

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Nov 02 2004

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 20:38 EST 2012. Contains 205663 sequences.