%I A083890
%S A083890 0,0,1,0,0,1,0,0,1,0,0,1,1,0,1,0,0,1,0,0,1,0,1,1,0,1,1,0,0,2,1,1,2,0,0,
%T A083890 1,0,0,2,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,0,0,1,0,0,2,0,1,1,1,1,2,0,0,2,0,
%U A083890 0,1,0,0,1,0,0,2,0,0,1,0,0,1,0,0,1,0,0,2,1,1,2,0,0,2,0,0,2,0,0,1,1,1,1
%N A083890 Number of divisors of n with largest digit = 3 (base 10).
%C A083890 a(n) = A000005(n) - A083888(n) - A083889(n) - A083891(n) - A083892(n) 
               - A083893(n) - A083894(n) - A083895(n) - A083896(n) = A083898(n) 
               - A083897(n).
%e A083890 n=132, 3 of the 12 divisors of 132 have largest digit =3:
%e A083890 {3,33,132}, therefore a(132)=3.
%Y A083890 Cf. A054055, A000005, A083898.
%Y A083890 Sequence in context: A105816 A062979 A114781 this_sequence A000989 A132401 
               A104273
%Y A083890 Adjacent sequences: A083887 A083888 A083889 this_sequence A083891 A083892 
               A083893
%K A083890 nonn,base
%O A083890 1,30
%A A083890 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 08 2003