|
Search: id:A158780
|
|
| |
|
| 0, 1, 1, 1, 2, 2, 4, 4, 8, 8, 16, 16, 32, 32, 64, 64, 128, 128, 256, 256, 512, 512, 1024, 1024, 2048, 2048, 4096, 4096, 8192, 8192, 16384, 16384, 32768, 32768, 65536, 65536, 131072, 131072, 262144, 262144, 524288
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
This construction combines the 2 basic sequences which equal their first differences in the same way as A138635 does for sequences which equal their 3rd differences and A137171 does for sequences which equal their fourth differences.
Essentially the same as A016116, A060546, and A131572. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 08 2009
Dropping a(0), this is the inverse binomial transform of A024537. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 08 2009
|
|
FORMULA
|
a(2n)+a(2n+1)= A000079(n).
G.f.: x*(1+x-x^2)/(1-2*x^2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 08 2009
|
|
CROSSREFS
|
Sequence in context: A082267 A076939 A131572 this_sequence A117575 A152166 A016116
Adjacent sequences: A158777 A158778 A158779 this_sequence A158781 A158782 A158783
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul Curtz (bpcrtz(AT)free.fr), Mar 26 2009
|
|
EXTENSIONS
|
Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 08 2009
|
|
|
Search completed in 0.002 seconds
|
