Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099786
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099786 Sum C(n-k,3k)3^(n-4k), k=0..floor(n/4). +0
3
1, 3, 9, 27, 82, 255, 819, 2727, 9397, 33312, 120537, 441855, 1631017, 6036879, 22345074, 82589247, 304612975, 1120960983, 4116353265, 15088372416, 55224373105, 201895801851, 737506551321, 2692518758163, 9826402960882 (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-3x)^2/((1-3x)^3-x^4); a(n)=9a(n-1)-27a(n-2)+27a(n-3)+a(n-4).

CROSSREFS

Cf. A003522, A097119, A099785, A099787.

Sequence in context: A078226 A083591 A052917 this_sequence A131428 A099787 A146786

Adjacent sequences: A099783 A099784 A099785 this_sequence A099787 A099788 A099789

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


AT&T Labs Research