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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069521 Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g. a(3k)=0. 21
2, 2, 0, 20, 20, 0, 1001, 200, 0, 20, 11, 0, 1001, 10010, 0, 2000, 100000001, 0, 1000000001, 20, 0, 110, 100000000001, 0, 200, 10010, 0, 100100, 100000000000001, 0, 0, 20000, 0, 1000000010, 10010, 0, 0, 10000000010, 0, 200, 0, 0, 0, 1100, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(3k)=a(31k)=a(37k)=a(41k)=a(43k)=a(53k)=a(67k)=a(71k)=a(79k)=a(83k)=0. - Ray Chandler, Jul 30 2003

LINKS

Table of n, a(n) for n=1..45.

EXAMPLE

a(7) =a(13) = 1001. digit sum of 1001 = 2 and is the smallest such multiple of 7 and 13. a(17) = 100000001= 17*5882353.

CROSSREFS

Sequence in context: A134085 A151339 A228273 * A245687 A228617 A119836

Adjacent sequences:  A069518 A069519 A069520 * A069522 A069523 A069524

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Apr 01 2002

EXTENSIONS

More terms from Ray Chandler, Jul 30 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 18:38 EDT 2019. Contains 326168 sequences. (Running on oeis4.)