This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A082811 #18 Feb 20 2023 05:16:33
%S A082811 2,2,21,20,20,24,21,24,27,20,22,24,26,28,210,208,204,216,209,20,21,22,
%T A082811 23,24,25,26,27,28,29,210,217,224,231,204,210,216,222,228,234,200,205,
%U A082811 210,215,220,225,230,235,240,245,200,204,208,212,216,220
%N A082811 Smallest multiple of n beginning with 2.
%C A082811 a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 11n, 12n, 13n, 14n}. [_Charles R Greathouse IV_, Mar 06 2011]
%H A082811 Reinhard Zumkeller, <a href="/A082811/b082811.txt">Table of n, a(n) for n = 1..10000</a>
%t A082811 f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 2, m += n]; m]; Array[f, 55] (* _Robert G. Wilson v_ *)
%o A082811 (PARI) a(n)=forstep(k=n, 14*n, n, if(Vec(Str(k))[1]=="2", return(k))) \\ _Charles R Greathouse IV_, Mar 06 2011
%o A082811 (Sage) def A082811(n): return next(k for k in PositiveIntegers() if (n*k).digits()[-1] == 2) # _D. S. McNeil_, Mar 07 2011
%o A082811 (Haskell)
%o A082811 a082811 n = until ((== 2) . a000030) (+ n) n
%o A082811 -- _Reinhard Zumkeller_, Mar 27 2012
%Y A082811 Cf. A082784, A054850, A082786, A082787, A082788, A082789, A082791.
%Y A082811 Cf. A000030.
%K A082811 base,easy,nonn
%O A082811 1,1
%A A082811 _Amarnath Murthy_, Apr 19 2003