cp's OEIS Frontend

A082796 Smallest multiple of n beginning with 6.

%I A082796 #23 Jun 06 2021 02:53:38
%S A082796 6,6,6,60,60,6,63,64,63,60,66,60,65,602,60,64,68,612,608,60,63,66,69,
%T A082796 600,600,624,621,616,609,60,62,64,66,68,630,612,629,608,624,600,615,
%U A082796 630,602,616,630,644,611,624,637,600,612,624,636,648,605,616,627,638
%N A082796 Smallest multiple of n beginning with 6.
%C A082796 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
%H A082796 Reinhard Zumkeller, <a href="/A082796/b082796.txt">Table of n, a(n) for n = 1..10000</a>
%t A082796 f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 6, m += n]; m]; Array[f, 55] (* _Robert G. Wilson v_ *)
%o A082796 (PARI) a(n)=forstep(k=n, 52*n, n, if(Vec(Str(k))[1]=="6", return(k))) \\ _Charles R Greathouse IV_, Mar 06 2011
%o A082796 (Haskell)
%o A082796 a082796 n = until ((== 6) . a000030) (+ n) n
%o A082796 -- _Reinhard Zumkeller_, Mar 27 2012
%o A082796 (Python)
%o A082796 def a(n):
%o A082796     m = n
%o A082796     while str(m)[0] != '6': m += n
%o A082796     return m
%o A082796 print([a(n) for n in range(1, 59)]) # _Michael S. Branicky_, Jun 06 2021
%Y A082796 Cf. A082794, A082795, A082797, A082798.
%Y A082796 Cf. A000030.
%K A082796 base,easy,nonn
%O A082796 1,1
%A A082796 _Amarnath Murthy_, Apr 20 2003
%E A082796 More terms from _Sean A. Irvine_, Mar 06 2011