|
| |
|
|
A078241
|
|
Smallest multiple of n using only digits 0 and 2.
|
|
19
| |
|
|
2, 2, 222, 20, 20, 222, 2002, 200, 222222222, 20, 22, 2220, 2002, 2002, 2220, 2000, 22202, 222222222, 22002, 20, 20202, 22, 220202, 22200, 200, 2002, 2202222222, 20020, 2202202, 2220, 222022, 20000, 222222, 22202, 20020, 2222222220, 222
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(n) = min{A169965(k): k > 1 and A169965(k) mod n = 0}. [Reinhard Zumkeller, Jan 10 2012]
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..998
|
|
|
FORMULA
| a(n) < 10^n / (0.45 n). [Charles R Greathouse IV, Jan 09 2012]
|
|
|
PROG
| (Haskell)
a078241 n = head [x | x <- tail a169965_list, mod x n == 0]
-- Reinhard Zumkeller, Jan 10 2012
|
|
|
CROSSREFS
| Cf. A004290, A078242-A078248, A079339, A096681-A096688.
Sequence in context: A194027 A003110 A100956 * A068103 A119512 A067091
Adjacent sequences: A078238 A078239 A078240 * A078242 A078243 A078244
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 23 2002
|
|
|
EXTENSIONS
| More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 12 2004
|
| |
|
|
