Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102591 a(n)=sum k=0..n, C(2n+1,2k)3^(n-k). +0
3
1, 6, 44, 328, 2448, 18272, 136384, 1017984, 7598336, 56714752, 423324672, 3159738368, 23584608256, 176037912576, 1313964867584, 9807567290368, 73204678852608, 546407161659392, 4078438577864704, 30441879976280064 (list; graph; listen)
OFFSET

0,2

COMMENT

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: A000561 A091162 A091163 this_sequence A114935 A115969 A082412

Adjacent sequences: A102588 A102589 A102590 this_sequence A102592 A102593 A102594

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research