Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016290
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016290 Expansion of 1/((1-2x)(1-4x)(1-8x)). +0
5
1, 14, 140, 1240, 10416, 85344, 690880, 5559680, 44608256, 357389824, 2861214720, 22898104320, 183218384896, 1465881288704, 11727587164160, 93822844764160, 750591347982336, 6004765143465984, 48038258586419200 (list; graph; listen)
OFFSET

0,2

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

FORMULA

Difference of Gaussian binomial coefficients [ n+1, 3 ]-[ n, 3 ] (n >= 2).

a(n)=(2^n-6*4^n+8*8^n)/3 - Jim Buddenhagen (jbuddenh(AT)gmail.com), Dec 14 2003

a(n)=sum{0<=i,j,k,<=n, i+j+k=n, 2^i*4^j*8^k}. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 25 2007

MAPLE

[ seq(GBC(n+1, 3, 2)-GBC(n, 3, 2), n=2..30) ]; # produces A016290 (cf. A006516).

seq((2^n-6*4^n+8*8^n)/3, n=1..20);

seq(binomial(2^n, 3)/4, n=2..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 22 2008

CROSSREFS

Cf. A006516.

Sequence in context: A021044 A121034 A125402 this_sequence A003457 A016241 A131583

Adjacent sequences: A016287 A016288 A016289 this_sequence A016291 A016292 A016293

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research