|
Search: id:A034008
|
|
| |
|
| 1, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Powers of 2 with additional first two terms.
Essentially the same as A131577 (and A000079).
[(-1)^n*a(n)] = [1,0,1,-2,4,-8,16,-32,...] is the inverse binomial transform of A008619 = [1,1,2,2,3,3,4,4,5,5,...]. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 15 2009]
|
|
FORMULA
|
a(n) = 2^(n-2), n >= 2; a(0)=1, a(1)=0; G.f.: (1-x)^2/(1-2*x).
|
|
PROGRAM
|
(PARI) a(n)=if(n<2, n==0, 2^(n-2))
|
|
CROSSREFS
|
First differences of 2^(n-1) (A011782). Cf. A011782.
Sequence in context: A155559 A166687 A011782 this_sequence A123344 A131577 A141531
Adjacent sequences: A034005 A034006 A034007 this_sequence A034009 A034010 A034011
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)
|
|
EXTENSIONS
|
Additional comments from Barry E. Williams, May 27 2000 and from Michael Somos, Jun 18, 2002
|
|
|
Search completed in 0.002 seconds
|
