The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069522 Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k). 9
 3, 12, 3, 12, 30, 12, 21, 120, 0, 30, 0, 12, 10101, 210, 30, 1200, 102, 0, 11001, 120, 21, 0, 2001, 120, 300, 101010, 0, 2100, 2001, 30, 10000011, 12000, 0, 102, 210, 0, 111, 110010, 10101, 120, 0, 210, 100100001, 0, 0, 20010, 10011, 1200, 1100001, 300, 102 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(9k)=a(11k)=a(41k)=a(73k)=a(79k)=a(101k)=0 - Ray Chandler, Jul 30 2003 a(2^k)=1.2*10^k [From David Brown, Dec 19 2009] LINKS Table of n, a(n) for n=1..51. FORMULA a(n) = n*A088392(n) . - R. J. Mathar, Aug 06 2019 CROSSREFS Cf. A069521. Sequence in context: A321710 A358325 A288518 * A170857 A227106 A085296 Adjacent sequences: A069519 A069520 A069521 * A069523 A069524 A069525 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 11 09:25 EDT 2024. Contains 375815 sequences. (Running on oeis4.)