Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099583
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099583 Sum C(n-k,k-1)2^(n-k-1)(3/2)^(k-1), k=0..floor(n/2). +0
1
0, 0, 1, 2, 10, 26, 91, 260, 820, 2420, 7381, 22022, 66430, 198926, 597871, 1792520, 5380840, 16139240, 48427561, 145272842, 435848050, 1307514626, 3922632451, 11767808780, 35303692060, 105910810460, 317733228541, 953198888462 (list; graph; listen)
OFFSET

0,4

COMMENT

In general a(n)=sum{k=0..floor(n/2), C(n-k,k-1)u^(n-k-1)(v/u)^(k-1)} has g.f. x^2/((1-v*x^2)(1-u*x-v*x^2)) and satisfies the recurrence a(n)=u*a(n-1)+2v*a(n-2)-u*v*a(n-3)-v^2*a(n-4).

FORMULA

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

CROSSREFS

Sequence in context: A099969 A025589 A084182 this_sequence A133479 A057753 A060515

Adjacent sequences: A099580 A099581 A099582 this_sequence A099584 A099585 A099586

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 23 2004

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research