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)
15
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; text; internal format)
OFFSET

0,3

COMMENTS

a(n) = A131382(n) * n. - Michel Marcus, Dec 10 2012

The subsequence of repdigits is: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 888, 999, 999999999, 999999999999999999999999999, ... and their indices are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 24, 27, 81, 243, 729, 999, ... - Michel Marcus, Apr 14 2015

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

H. Fredricksen, E. J. Ionascu, F. Luca, P. Stanica, Minimal Niven numbers, arXiv:0803.0477 [math.NT], 2008.

H. Fredricksen, E. J. Ionascu, F. Luca, P. Stanica, Minimal Niven numbers, Acta Arithmetica 132(2008), 135-159.

H. W. Gould, Letters to N. J. A. Sloane, 1974

David Wilson, C++ program

MATHEMATICA

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

PROG

(PARI) a(n)=my(k); while(sumdigits(k+=n)!=n, ); k \\ Charles R Greathouse IV, Feb 01 2013

CROSSREFS

Cf. A005349, A131382.

Sequence in context: A032569 A254960 A039723 * A061276 A249515 A217555

Adjacent sequences:  A002995 A002996 A002997 * A002999 A003000 A003001

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Erich Friedman, Jul 04 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 24 04:58 EDT 2017. Contains 291052 sequences.