This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058898 Inconsummate numbers in base 2: no number is this multiple of the sum of its digits (in base 2). 16

%I

%S 13,19,25,26,35,38,47,49,50,52,55,67,70,76,94,95,97,98,100,103,104,

%T 109,110,115,117,131,134,140,151,152,157,159,171,175,179,183,185,187,

%U 188,190,193,194,196,199,200,203,206,208,217,218,220,227,229

%N Inconsummate numbers in base 2: no number is this multiple of the sum of its digits (in base 2).

%C Equivalently, these are the natural numbers that cannot be written as the arithmetic mean of distinct powers of 2. [From _Brian Kell_, Feb 28 2009]

%H Daniel Mondot, <a href="/A058898/b058898.txt">Table of n, a(n) for n = 1..33099</a>

%H D. Radcliffe, <a href="http://gotmath.com/inconsummate.html">Inconsummate Numbers</a> [broken link]

%F n such that A065413(n) = 0. [From _Brian Kell_, Mar 01 2009]

%p For Maple code see A058906.

%t Do[k = n; While[ Apply[ Plus, IntegerDigits[k, 2] ]*n != k && k < 250n, k += n]; If[k == 250n, Print[n] ], {n, 1, 10^3} ]

%Y Cf. A003635, A052491, A058899-A058907.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Jan 09 2001

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.

Last modified December 9 09:20 EST 2019. Contains 329877 sequences. (Running on oeis4.)