cp's OEIS Frontend

A082792 Smallest multiple of n beginning with 3.

%I A082792 #22 Mar 30 2021 15:20:51
%S A082792 3,30,3,32,30,30,35,32,36,30,33,36,39,308,30,32,34,36,38,300,315,308,
%T A082792 322,312,300,312,324,308,319,30,31,32,33,34,35,36,37,38,39,320,328,
%U A082792 336,301,308,315,322,329,336,343,300,306,312,318,324,330,336,342,348,354
%N A082792 Smallest multiple of n beginning with 3.
%C A082792 a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 11n, 12n, 13n, 14n, 15n, 21n, 22n, 23n}. - _Charles R Greathouse IV_, Mar 06 2011
%H A082792 Reinhard Zumkeller, <a href="/A082792/b082792.txt">Table of n, a(n) for n = 1..10000</a>
%t A082792 f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 3, m += n]; m]; Array[f, 59] (* _Robert G. Wilson v_, Mar 06 2011 *)
%o A082792 (PARI) a(n)=forstep(k=n,23*n,n,if(Vec(Str(k))[1]=="3",return(k))) \\ _Charles R Greathouse IV_, Mar 06 2011
%o A082792 (Haskell)
%o A082792 a082792 n = until ((== 3) . a000030) (+ n) n
%o A082792 -- _Reinhard Zumkeller_, Mar 27 2012
%o A082792 (Python)
%o A082792 def a(n):
%o A082792   kn = n
%o A082792   while str(kn)[0] != '3': kn += n
%o A082792   return kn
%o A082792 print([a(n) for n in range(1, 60)]) # _Michael S. Branicky_, Mar 30 2021
%Y A082792 Cf. A082793, A082794, A082795, A082796.
%Y A082792 Cf. A000030.
%K A082792 base,easy,nonn
%O A082792 1,1
%A A082792 _Amarnath Murthy_, Apr 20 2003
%E A082792 Corrected and extended by _Sean A. Irvine_, Mar 06 2011