%I A119483
%S A119483 5,37,2,143,1,77,653,579,4787,37969,3581,3,271,25607,213,1887,186629,
%T A119483 1641,16433,141,137,126709,1217,123709,114433,1,107767,934673,9183579,
%U A119483 8947,86693,771,73,792159,739,7351,64338223,6197,66533,5843937
%N A119483 Multipliers of sequential primes required to produce a product consisting 
               of digits not greater than 1.
%C A119483 a(n) is the smallest number m such that the largest digit of m*prime(n) 
               is 1. - Farideh Firoozbakht (mymontain(AT)yahoo.com), Jun 03 2006
%F A119483 Find the number which when multiplied by the next prime, produces a product 
               of all 1's and 0's or all 1's
%e A119483 a(1)=37 because 3*37=111
%t A119483 a[n_]:=(For[m=1, Max[IntegerDigits[m*Prime[n]]]!=1,m++ ];m); Do[Print[a[n]],
               {n,1,40}] - Farideh Firoozbakht (mymontain(AT)yahoo.com), Jun 03 
               2006
%o A119483 UBASIC 10 'neils361, Enoch Haga, 20 May 2006 11 'inspired by Carlos Rivera's 
               Puz361 20 N=19:Y=Y+1:K=0 30 Z=N*Y 40 S=str(Z) 50 A=alen(Z) 60 for 
               X=2 to A+1 70 M=val(mid(S,X,1)) 80 if M>1 then K=K+1 90 next X 100 
               if K=0 then print Z,N,Y,K:stop 110 Y=Y+1:K=0:goto 30
%Y A119483 Cf. A119484.
%Y A119483 Sequence in context: A118018 A156355 A002666 this_sequence A157809 A079339 
               A043075
%Y A119483 Adjacent sequences: A119480 A119481 A119482 this_sequence A119484 A119485 
               A119486
%K A119483 easy,nonn
%O A119483 0,1
%A A119483 Enoch Haga (Enokh(AT)comcast.net), May 23 2006