cp's OEIS Frontend

A082798 Smallest multiple of n beginning with 8.

%I A082798 #21 Aug 08 2021 16:24:18
%S A082798 8,8,81,8,80,84,84,8,81,80,88,84,806,84,810,80,85,810,817,80,84,88,
%T A082798 805,816,800,806,81,84,87,810,806,800,825,816,805,828,814,836,819,80,
%U A082798 82,84,86,88,810,828,846,816,833,800,816,832,848,810,825,840,855,812
%N A082798 Smallest multiple of n beginning with 8.
%C A082798 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, 27n, 31n, 32n, 33n, 34n, 35n, 36n, 41n, 42n, 43n, 44n, 45n, 51n, 52n, 53n, 54n, 61n, 62n, 63n, 71n, 72n}. [_Charles R Greathouse IV_, Mar 06 2011]
%H A082798 Reinhard Zumkeller, <a href="/A082798/b082798.txt">Table of n, a(n) for n = 1..10000</a>
%t A082798 f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 8, m += n]; m]; Array[f, 55] (* _Robert G. Wilson v_ *)
%o A082798 (PARI) a(n)=forstep(k=n, 72*n, n, if(Vec(Str(k))[1]=="8", return(k))) \\ _Charles R Greathouse IV_, Mar 06 2011
%o A082798 (Haskell)
%o A082798 a082798 n = until ((== 8) . a000030) (+ n) n
%o A082798 -- _Reinhard Zumkeller_, Mar 27 2012
%o A082798 (Python)
%o A082798 def a(n):
%o A082798     m = n
%o A082798     while str(m)[0] != '8': m += n
%o A082798     return m
%o A082798 print([a(n) for n in range(1, 59)]) # _Michael S. Branicky_, Aug 08 2021
%Y A082798 Cf. A082794, A082795, A082796, A082797.
%Y A082798 Cf. A000030.
%K A082798 base,easy,nonn
%O A082798 1,1
%A A082798 _Amarnath Murthy_, Apr 20 2003
%E A082798 Corrected and extended by _Sean A. Irvine_, Mar 06 2011