A260814 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A260814

Powers of 2 with distinct digits.

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 1048576, 536870912

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..18.

FORMULA

a(n) = 2^A084688(n).

MATHEMATICA

Select[2^Range[0, 34], Max@ DigitCount@ # == 1 &] (* Michael De Vlieger, Aug 03 2015 *)

PROG

(PARI) lista() = {lim = ceil(log(10^11)/(log(2))); for (n=0, lim, d = digits(2^n); if (#vecsort(d, , 8) == #d, print1(n, ", ")); ); } \\ Michel Marcus, Aug 03 2015

CROSSREFS

Cf. A000079, A029743, A084688.

Sequence in context: A364040 A050732 A371863 * A274864 A274863 A138815

Adjacent sequences: A260811 A260812 A260813 * A260815 A260816 A260817

KEYWORD

nonn,base,fini,full

AUTHOR

Zak Seidov, Aug 02 2015

STATUS

approved