This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A003634 Smallest positive number that is n times sum of its digits, or 0 if no such number exists. (Formerly M5054) 12
 1, 18, 27, 12, 45, 54, 21, 72, 81, 10, 198, 108, 117, 126, 135, 144, 153, 162, 114, 180, 378, 132, 207, 216, 150, 234, 243, 112, 261, 270, 372, 576, 594, 102, 315, 324, 111, 342, 351, 120, 738, 756, 516, 792, 405, 230, 423, 432, 441, 450, 918, 312, 954, 972 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = 0 for n=62, 63, 65, ... (A003635). REFERENCES J. H. Conway, personal communication. Anthony Gardiner, Mathematical Puzzling, Dover Publications, Inc., Mineola, NY, 1987, Page 11. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS Donovan Johnson, Table of n, a(n) for n = 1..10000 EXAMPLE a(3) = 27 because no number less than 27 has sum of its digits equal to 3 times the number. MATHEMATICA Do[k = n; While[Apply[Plus, RealDigits[k][[1]]]*n != k, k += n]; Print[k], {n, 1, 61}] With[{ll=Select[Table[{n, n/Total[IntegerDigits[n]]}, {n, 1000}], IntegerQ[ #[[2]]]&]}, Table[Select[ll, #[[2]]==i&, 1][[1, 1]], {i, 60}]] (* Harvey P. Dale, Mar 09 2012 *) CROSSREFS Cf. A005349. Sequence in context: A093018 A284493 A167336 * A220100 A080910 A036763 Adjacent sequences:  A003631 A003632 A003633 * A003635 A003636 A003637 KEYWORD nonn,base,easy,nice AUTHOR EXTENSIONS Additional comments from Robert G. Wilson v, Aug 15 2000 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 October 14 02:29 EDT 2019. Contains 327995 sequences. (Running on oeis4.)