The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069035 Smallest proper multiple of n with digit sum n. 4
 10, 20, 12, 40, 50, 24, 70, 80, 18, 190, 209, 48, 247, 266, 195, 448, 476, 198, 874, 3980, 399, 2398, 1679, 888, 4975, 1898, 999, 7588, 4988, 39990, 8959, 17888, 42999, 28798, 57995, 29988, 37999, 59888, 49998, 699880, 177899, 88998, 99889, 479996 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS David A. Corneth, Table of n, a(n) for n = 1..274 MATHEMATICA ssm[n_]:=Module[{k=2}, While[Total[IntegerDigits[k*n]]!=n, k++]; k*n]; Array[ ssm, 50] (* Harvey P. Dale, Nov 24 2012 *) PROG (PARI) a(n) = {my(m=2*n); while (sumdigits(m) != n, m+=n); m; } \\ Michel Marcus, Feb 24 2016 CROSSREFS Cf. A002998, A007953. Sequence in context: A249585 A067524 A069555 * A245065 A040090 A183195 Adjacent sequences:  A069032 A069033 A069034 * A069036 A069037 A069038 KEYWORD nonn,base AUTHOR Amarnath Murthy, Apr 02 2002 EXTENSIONS Offset corrected by Harvey P. Dale, Nov 24 2012 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 April 15 11:07 EDT 2021. Contains 342977 sequences. (Running on oeis4.)