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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100068 Sum binomial(n,k)3^(n-2k), k=0..floor(n/2). 2
1, 3, 11, 36, 123, 408, 1370, 4560, 15235, 50760, 169326, 564336, 1881582, 6271632, 20907156, 69689376, 232304355, 774343560, 2581169510, 8603882160, 28679699578, 95598937008, 318663476076, 1062211351776, 3540705857998 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

An inverse Chebyshev transform of x/(1-3x), 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).

FORMULA

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

CROSSREFS

Cf. A027306, A100067, A100069.

Sequence in context: A119088 A017937 A017938 * A119213 A068644 A119054

Adjacent sequences:  A100065 A100066 A100067 * A100069 A100070 A100071

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 00:47 EST 2012. Contains 205567 sequences.