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!)
 A052491 Smallest "inconsummate number" in base n: smallest number such that in base n, no number is this multiple of the sum of its digits. 13
 13, 17, 29, 16, 27, 30, 42, 46, 62, 68, 86, 92, 114, 122, 147, 154, 182, 192, 222, 232, 266, 278, 314, 326, 367, 380, 422, 436, 482, 498, 546, 562, 614, 632, 688, 704, 762, 782, 842, 862, 926, 948, 1014, 1036, 1107, 1130, 1202, 1226, 1302, 1328, 1406, 1432 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS David Radcliffe, Inconsummate Numbers EXAMPLE a(10) = 62, from A003635. MATHEMATICA Do[n = 1; While[k = n; While[ Apply[ Plus, IntegerDigits[k, b] ]*n != k && k < 100n, k += n ]; k != 100n, n++ ]; Print[n], {b, 2, 54} ] CROSSREFS Cf. A003635, A058898-A058907. Sequence in context: A155923 A248215 A283135 * A283294 A283217 A283390 Adjacent sequences:  A052488 A052489 A052490 * A052492 A052493 A052494 KEYWORD nonn,nice,easy,base AUTHOR J. H. Conway, Dec 30 2000 EXTENSIONS Corrected and extended by David Radcliffe, Jan 08 2001 More terms from David W. Wilson, Jan 10 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.

Last modified December 10 12:43 EST 2019. Contains 329896 sequences. (Running on oeis4.)