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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102591 a(n)=sum k=0..n, C(2n+1,2k)3^(n-k). 4
1, 6, 44, 328, 2448, 18272, 136384, 1017984, 7598336, 56714752, 423324672, 3159738368, 23584608256, 176037912576, 1313964867584, 9807567290368, 73204678852608, 546407161659392, 4078438577864704, 30441879976280064 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

In general, sum{k=0..n, C(2n+1,2k)r^(n-k)} has g.f. (1-(r-1)x)/(1-2(r+1)+(r-1)^2x^2) and a(n)=((sqrt(r)-1)^(2n+1)+(sqrt(r)+1)^(2n+1))/(2sqrt(r)).

FORMULA

G.f.: (1-2x)/(1-8x+4x^2); a(n)=8a(n-1)-4a(n-2); a(n)=sqrt(3)(sqrt(3)-1)^(2n+1)/6+sqrt(3)(sqrt(3)+1)^(2n+1)/6.

CROSSREFS

Cf. A066443, A102592.

Sequence in context: A156002 A091163 A189800 * A114935 A115969 A082412

Adjacent sequences:  A102588 A102589 A102590 * A102592 A102593 A102594

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 22 2005

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 08:49 EST 2012. Contains 205614 sequences.