|
|
A082811
|
|
Smallest multiple of n beginning with 2.
|
|
4
|
|
|
2, 2, 21, 20, 20, 24, 21, 24, 27, 20, 22, 24, 26, 28, 210, 208, 204, 216, 209, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 210, 217, 224, 231, 204, 210, 216, 222, 228, 234, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 200, 204, 208, 212, 216, 220
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 11n, 12n, 13n, 14n}. [Charles R Greathouse IV, Mar 06 2011]
|
|
LINKS
|
|
|
MATHEMATICA
|
f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 2, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)
|
|
PROG
|
(Sage) def A082811(n): return next(k for k in PositiveIntegers() if (n*k).digits()[-1] == 2) # D. S. McNeil, Mar 07 2011
(Haskell)
a082811 n = until ((== 2) . a000030) (+ n) n
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|