The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Dec 03 2021 14:43:10
%S 10,20,30,40,50,60,70,80,90,100,101,102,103,104,105,106,107,108,109,
%T 110,120,130,140,150,160,170,180,190,200,201,202,203,204,205,206,207,
%U 208,209,210,212,214,216,218,220,230,240,250,260,270,280,290,300,301,302,303,304,305,306,307,308,309,310,312,315,318,320,321,324,327,330,340,350,360,370,380,390,400
%N Numbers n such that smallest digit of all divisors of n is 0.
%C Also numbers n such that smallest digit of concatenation of all divisors of n (A037278 or A176558) is 0.
%C Sequence is not the same as A011540, first deviation is at a(41): A011540(41) = 220, a(41) = 214.
%e Number 214 is in sequence because smallest digit of all divisors of 214 (1, 2, 107, 214) is 0.
%t Select[Range[400],Min[Flatten[IntegerDigits/@Divisors[#]]]==0&] (* _Harvey P. Dale_, Dec 03 2021 *)
%Y Cf. A209929 (smallest digit of all divisors of n), complement of A209931.
%K nonn,base
%O 1,1
%A _Jaroslav Krizek_, Mar 20 2012
%E Corrected and extended by _Harvey P. Dale_, Dec 03 2021