%I A007627 M4888
%S A007627 13,19,23,29,49,59,79,89,103,109,111,133,199,203,209,211,233,299,311,
%T A007627 409,411,433,499,509,511,533,599,611,709,711,733,799,809,811,833,899,
%U A007627 911,1003,1009,1011,1027,1033,1037,1099,1111,1133,1199,1233
%N A007627 Primitive modest numbers.
%C A007627 Modest numbers (A054986) are the same but without assuming (a,b)=1.
%D A007627 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007627 Problem 1291, J. Rec. Math., 17 (No.2, 1984), 140-141.
%F A007627 n = a*10^k + b such that (a, b)=1, n == a (mod b), a<b<10^k.
%Y A007627 Cf. A054986, A055018.
%Y A007627 Sequence in context: A160951 A038888 A113017 this_sequence A121877 A109902 
               A058898
%Y A007627 Adjacent sequences: A007624 A007625 A007626 this_sequence A007628 A007629 
               A007630
%K A007627 nonn,easy
%O A007627 1,1
%A A007627 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com), 
               Mira Bernstein (mira(AT)math.berkeley.edu)