|
|
A082796
|
|
Smallest multiple of n beginning with 6.
|
|
8
|
|
|
6, 6, 6, 60, 60, 6, 63, 64, 63, 60, 66, 60, 65, 602, 60, 64, 68, 612, 608, 60, 63, 66, 69, 600, 600, 624, 621, 616, 609, 60, 62, 64, 66, 68, 630, 612, 629, 608, 624, 600, 615, 630, 602, 616, 630, 644, 611, 624, 637, 600, 612, 624, 636, 648, 605, 616, 627, 638
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 9n, 11n, 12n, 13n, 14n, 15n, 16n, 17n, 18n, 21n, 22n, 23n, 24n, 25n, 26n, 31n, 32n, 33n, 34n, 35n, 41n, 42n, 43n, 51n, 52n}. - Charles R Greathouse IV, Mar 06 2011
|
|
LINKS
|
|
|
MATHEMATICA
|
f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 6, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)
|
|
PROG
|
(Haskell)
a082796 n = until ((== 6) . a000030) (+ n) n
(Python)
def a(n):
m = n
while str(m)[0] != '6': m += n
return m
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|