cp's OEIS Frontend

A054054 Smallest digit of n.

%I A054054 #31 Feb 27 2020 20:35:19
%S A054054 0,1,2,3,4,5,6,7,8,9,0,1,1,1,1,1,1,1,1,1,0,1,2,2,2,2,2,2,2,2,0,1,2,3,
%T A054054 3,3,3,3,3,3,0,1,2,3,4,4,4,4,4,4,0,1,2,3,4,5,5,5,5,5,0,1,2,3,4,5,6,6,
%U A054054 6,6,0,1,2,3,4,5,6,7,7,7,0,1,2,3,4,5,6,7,8,8,0,1,2,3,4,5,6,7,8,9,0,0,0,0,0
%N A054054 Smallest digit of n.
%C A054054 a(n) = 0 for almost all n. - _Charles R Greathouse IV_, Oct 02 2013
%C A054054 More precisely, a(n) = 0 asymptotically almost surely, i.e., except for a set of density 0: As the number of digits of n grows, the probability of having no zero digit goes to zero as 0.9^(length of n), although there are infinitely many counterexamples. - _M. F. Hasler_, Oct 11 2015
%H A054054 Reinhard Zumkeller, <a href="/A054054/b054054.txt">Table of n, a(n) for n = 0..10000</a>
%F A054054 a(A011540(n)) = 0; a(A052382(n)) > 0. - _Reinhard Zumkeller_, Apr 25 2012
%F A054054 a(n) = A262188(n,0). - _Reinhard Zumkeller_, Sep 14 2015
%F A054054 a(n) = 0 iff A007954(n) = 0. - _M. F. Hasler_, Oct 11 2015
%F A054054 a(n) = 9 - A054055(A061601(n)). - _Robert Israel_, Jul 07 2016
%e A054054 a(12) = 1 because 1 < 2.
%p A054054 seq(min(convert(n,base,10)),n=0..100); # _Robert Israel_, Jul 07 2016
%t A054054 A054054[n_]:=Min[IntegerDigits[n]]
%o A054054 (Haskell)
%o A054054 a054054 = f 9 where
%o A054054    f m x | x <= 9 = min m x
%o A054054          | otherwise = f (min m d) x' where (x',d) = divMod x 10
%o A054054 -- _Reinhard Zumkeller_, Jun 20 2012, Apr 25 2012
%o A054054 (PARI) A054054(n)=if(n,vecmin(digits(n)))  \\ or: Set(digits(n))[1]. - _M. F. Hasler_, Jan 23 2013
%Y A054054 Cf. A054055.
%Y A054054 Cf. A061601, A011540, A052382, A262188.
%K A054054 base,easy,nonn
%O A054054 0,3
%A A054054 _Henry Bottomley_, Apr 29 2000
%E A054054 Edited by _M. F. Hasler_, Oct 11 2015