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

 

Logo

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!)
A058906 Inconsummate numbers in base 11: no number is this multiple of the sum of its digits (in base 11). 10
68, 70, 79, 80, 82, 92, 104, 200, 202, 212, 214, 224, 225, 248, 260, 314, 320, 332, 380, 392, 452, 458, 464, 490, 502, 508, 512, 513, 514, 518, 520, 524, 530, 562, 568, 574, 578, 579, 580, 584, 585, 590, 592, 595, 598, 599, 622, 628, 634, 635 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

David Radcliffe, Inconsummate Numbers [broken link]

MAPLE

digitsum := proc (n, b) local i; add(i, i=convert(n, base, b)) end; b := 11:N := 43922; L := []: for n from 1 to N do k := digitsum(n, b): if (n mod k)=0 then L := [op(L), n/k] fi: od: M := []: for i from 1 to 1000 do if not(member(i, L)) then M := [op(M), i] fi od: lprint(M);

MATHEMATICA

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

CROSSREFS

Cf. A003635, A052491, A058898-A058907.

Sequence in context: A043862 A043871 A269987 * A130694 A269748 A153831

Adjacent sequences:  A058903 A058904 A058905 * A058907 A058908 A058909

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Jan 09 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 December 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)