|
| |
|
|
A078243
|
|
Smallest multiple of n using only digits 0 and 4.
|
|
3
| |
|
|
4, 4, 444, 4, 40, 444, 4004, 40, 444444444, 40, 44, 444, 4004, 4004, 4440, 400, 44404, 444444444, 44004, 40, 40404, 44, 440404, 4440, 400, 4004, 4404444444, 4004, 4404404, 4440, 444044, 4000, 444444, 44404, 40040, 444444444, 444, 44004, 40404
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| a(n) = min{A169967(k): k > 1 and A169967(k) mod n = 0}. [Reinhard Zumkeller, Jan 10 2012]
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..998
|
|
|
PROG
| (Haskell)
a078243 n = head [x | x <- tail a169967_list, mod x n == 0]
-- Reinhard Zumkeller, Jan 10 2012
|
|
|
CROSSREFS
| Cf. A004290, A078241-A078248, A079339, A096681-A096688.
Sequence in context: A107052 A000790 A068556 * A024246 A024247 A067445
Adjacent sequences: A078240 A078241 A078242 * A078244 A078245 A078246
|
|
|
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
|
| |
|
|
