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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002998 Smallest multiple of n whose digits sum to n.
(Formerly M0489)
10
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 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, 499995 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

David Wilson, Table of n, a(n) for n=0..1000

David Wilson, C++ program

MATHEMATICA

Flatten[Table[Select[n Range[100000], Total[IntegerDigits[#]]==n&, 1], {n, 0, 50}]] (* From Harvey P. Dale, Oct 30 2011 *)

CROSSREFS

Cf. A131382

Sequence in context: A005188 A032569 A039723 * A061276 A137667 A117954

Adjacent sequences:  A002995 A002996 A002997 * A002999 A003000 A003001

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Erich Friedman (efriedma(AT)stetson.edu), Jul 04 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.