Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099623
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099623 Sum C(n-k,k+2)2^(n-k-2)(3/2)^k, k=0..floor(n/2). +0
3
0, 0, 1, 6, 27, 104, 369, 1242, 4039, 12828, 40077, 123758, 379011, 1153872, 3498025, 10572354, 31884543, 96010436, 288788613, 867967830, 2607282235, 7828953720, 23501774241, 70536546986, 211674885687, 635160738924, 1905765565309 (list; graph; listen)
OFFSET

0,4

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A054457 A000395 A005325 this_sequence A119852 A027471 A037695

Adjacent sequences: A099620 A099621 A099622 this_sequence A099624 A099625 A099626

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 25 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research