Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108486 Sum binomial(2n-2k,2k)3^k*2^(n-k), k=0..floor(n/2). +0
2
1, 2, 10, 80, 412, 2456, 14680, 85376, 503056, 2959136, 17381536, 102199040, 600757696, 3531251072, 20758107520, 122021457920, 717273440512, 4216334967296, 24784750512640, 145691471876096, 856414086962176 (list; graph; listen)
OFFSET

0,2

COMMENT

In general, sum{k=0..floor(n/2), C(2n-2k,2k)a^k*b^(n-k)} has expansion (1-bx-abx^2)/(1-2bx-(2ab-b^2)x^2-2ab^2*x^3+(ab)^2*x^4).

FORMULA

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

CROSSREFS

Sequence in context: A098636 A081363 A100248 this_sequence A003578 A048286 A133480

Adjacent sequences: A108483 A108484 A108485 this_sequence A108487 A108488 A108489

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jun 04 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 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research