Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099785
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099785 Sum C(n-k,3k)2^(n-3k), k=0..floor(n/4). +0
2
1, 2, 4, 8, 18, 48, 144, 448, 1380, 4152, 12224, 35456, 102024, 292768, 840416, 2416384, 6959504, 20069280, 57913536, 167158656, 482462752, 1392319488, 4017460224, 11590946816, 33439639616, 96470796672, 278311599616 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

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

CROSSREFS

Cf. A003522, A097119, A099786, A099787.

Sequence in context: A113989 A126757 A034766 this_sequence A135422 A116723 A058374

Adjacent sequences: A099782 A099783 A099784 this_sequence A099786 A099787 A099788

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Oct 26 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research