Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097787
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097787 a(n)=3a(n-1)+C(n+4,4),n>0, a(0)=1. +0
2
1, 8, 39, 152, 526, 1704, 5322, 16296, 49383, 148864, 447593, 1344144, 4034252, 12105136, 36318468, 108959280, 326882685, 980654040, 2941969435, 8825917160, 26477762106, 79433298968, 238299911854, 714899753112, 2144699279811 (list; graph; listen)
OFFSET

0,2

COMMENT

Partial sums of A097786.

FORMULA

G.f. : 1/((1-3x)(1-x)^5); a(n)=3^(n+5)/32-(2n^4+32n^3+196n^2+556n+633)/96; a(n)=sum{k=0..n, binomial(n+5, k+5)2^k}.

CROSSREFS

Sequence in context: A063002 A055581 A134415 this_sequence A045909 A120931 A069083

Adjacent sequences: A097784 A097785 A097786 this_sequence A097788 A097789 A097790

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Aug 24 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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research