login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A155559
a(n) = 2*A131577(n).
10
0, 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, 4294967296, 8589934592
OFFSET
0,2
COMMENTS
Essentially the same as A131577, A046055, A011782, A000079 and A034008.
FORMULA
a(n) = A000079(n), n>0.
a(n) = (-1)^(n+1)*A084633(n+1).
a(n) + A155543(n) = 2^n+4^n = A063376(n) = 2*A007582(n) =2*A137173(2n+1).
Conjecture: a(n) = A090129(n+3)-A090129(n+2).
G.f.: 2*x/(1-2*x). - R. J. Mathar, Jul 23 2009
MATHEMATICA
CoefficientList[ Series[ 2x/(1 - 2x), {x, 0, 32}], x] (* Robert G. Wilson v, Aug 08 2018 *)
PROG
(PARI) a(n)=if(n, 2^n, 0) \\ Charles R Greathouse IV, Aug 01 2016
(Python)
def A155559(n): return 1<<n if n else 0 # Chai Wah Wu, Sep 05 2024
CROSSREFS
Sequence in context: A011782 A120617 A131577 * A166444 A171449 A122803
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Jan 24 2009
EXTENSIONS
Edited by R. J. Mathar, Jul 23 2009
Extended by Omar E. Pol, Nov 19 2012
STATUS
approved