%I A107740
%S A107740 1,0,0,0,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,0,2,2,2,2,2,1,1,1,1,1,
%T A107740 1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,1,0,1,1,1,2,2,2,2,1,1,1,1,
%U A107740 1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,2,2,1,1,0,1,1,0,1
%N A107740 Number of numbers m such that prime(n) = m+(digit sum of m).
%C A107740 a(A006378(n)) = 0; a(A048521(n)) > 0;
%C A107740 a(n)<=2 for n<=10^5, conjecture: sequence is bounded.
%e A107740 A000040(26)=101=91+(9+1)=100+(1+0+0): a(26)=#{91,100}=2.
%Y A107740 Cf. A007953, A000040, A062028, A047791, A107741.
%Y A107740 Sequence in context: A027360 A037806 A038082 this_sequence A016016 A063059 
               A102675
%Y A107740 Adjacent sequences: A107737 A107738 A107739 this_sequence A107741 A107742 
               A107743
%K A107740 nonn,base
%O A107740 1,26
%A A107740 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 23 2005