Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Feb 14 2018 22:48:37
%S 1,10,102,1050,10080,101010,1021020,10210200,100150050,1009788780,
%T 10039179150,100614884370,1002802450650,10028024506500,
%U 100093293239940,1003203571630260,10040258696397930,100098336700452090,1004819888620217670,10034477941390913010,100227034561924099830,1004115014967006472530,10014709889018759594670
%N Smallest n-digit number m such that phi(m) is minimal.
%C For all n, A147551(n) = phi(a(n)).
%H Max Alekseyev, <a href="/A147550/b147550.txt">Table of n, a(n) for n = 1..31</a>
%e phi(10)=4 and there is no 2-digit number t such that phi(t)<4 so a(2)=10.
%e phi(102)=32 and there is no 3-digit number t such that phi(t)<32 also phi(100) and phi(101) are greater than 32, so a(3)=102.
%Y Cf. A147551.
%K base,nonn
%O 1,2
%A _Farideh Firoozbakht_, Nov 22 2008
%E a(11)-a(31) from _Max Alekseyev_, Feb 02 2012, Feb 14 2018