|
Search: id:A003634
|
|
|
| A003634 |
|
Smallest positive number that is n times sum of its digits, or 0 if no such number exists.
(Formerly M5054)
|
|
+0
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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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).
|
|
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}]
|
|
CROSSREFS
|
Cf. A005349.
Sequence in context: A109769 A093018 A167336 this_sequence A080910 A036763 A151741
Adjacent sequences: A003631 A003632 A003633 this_sequence A003635 A003636 A003637
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein
|
|
EXTENSIONS
|
Additional comments from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 15 2000
|
|
|
Search completed in 0.002 seconds
|
