Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016152
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016152 4^(n-1)*(2^n-1). +0
4
0, 1, 12, 112, 960, 7936, 64512, 520192, 4177920, 33488896, 268173312, 2146435072, 17175674880, 137422176256, 1099444518912, 8795824586752, 70367670435840, 562945658454016, 4503582447501312, 36028728299487232 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=[(8^(n+1))-4^(n+1)]/4. a(n)=12a(n-1)-32a(n-2), n>0; a(0)=1 - Barry E. Williams, Jan 17 2000

a(n)= (4^(n-1))*stirling2(n+1, 2), n>=0, with stirling2(n, m)=A008277(n, m).

a(n)= -4^(n-1)+2*8^(n-1).

E.g.f. for a(n+1), n>=0: diff((((exp(4*x)-1)/4)^2)/2!, x$2) = -exp(4*x)+2*exp(8*x).

G.f.: x/((1-4*x)*(1-8*x)).

CROSSREFS

Second column of triangle A075499.

Cf. A019677.

Adjacent sequences: A016149 A016150 A016151 this_sequence A016153 A016154 A016155

Sequence in context: A044344 A130838 A044725 this_sequence A089700 A083767 A124651

KEYWORD

nonn

AUTHOR

njas

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research