login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067499 Powers of 2 with digit sum also a power of 2. 13
1, 2, 4, 8, 512, 68719476736, 38685626227668133590597632, 95780971304118053647396689196894323976171195136475136, 25108406941546723055343157692830665664409421777856138051584, 1606938044258990275541962092341162602522202993782792835301376 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Question is the sequence finite or infinite?

LINKS

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

FORMULA

a(n) = 2^k with digit sum a(n) = 2^r.

EXAMPLE

512 = 2^9 and 5+1+2 = 8 = 2^3. 68719476736 = 2^36. sum of digits = 64 = 2^6

MAPLE

with(numtheory): pow2 := [2^i$ i=1..2000]: for n from 1 to 1000 do L1 := convert(2^n, base, 10): if member(sum(L1[i], i=1..nops(L1)), pow2) then printf(`%d, `, 2^n) fi: od: (Sellers)

MATHEMATICA

Select[Table[2^n, {n, 0, 250}], IntegerQ[Log[2, Total[IntegerDigits[#]]]] &] (* Jayanta Basu, May 19 2013 *)

CROSSREFS

Sequence in context: A013553 A302864 A061089 * A135212 A012456 A071686

Adjacent sequences:  A067496 A067497 A067498 * A067500 A067501 A067502

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Apr 19 2001

EXTENSIONS

More terms from James A. Sellers, Apr 19 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 11 18:50 EST 2019. Contains 329031 sequences. (Running on oeis4.)