|
Search: id:A069521
|
|
|
| A069521 |
|
Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g. a(3k)=0. |
|
+0
22
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(3k)=a(31k)=a(37k)=a(41k)=a(43k)=a(53k)=a(67k)=a(71k)=a(79k)=a(83k)=0. - Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 30 2003
|
|
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: A117270 A091466 A134085 this_sequence A119836 A030619 A016370
Adjacent sequences: A069518 A069519 A069520 this_sequence A069522 A069523 A069524
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 01 2002
|
|
EXTENSIONS
|
More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 30 2003
|
|
|
Search completed in 0.002 seconds
|
