Search: id:A095840
Results 1-1 of 1 results found.

%I A095840
%S A095840 0,1,1,2,2,2,3,3,3,3,4,3,3,2,3,4,3,3,7,2,3,3,2,3,2,2,3,7,2,2,3,2,4,4,3,
%T A095840 2,2,2,2,2,4,2,3,1,11,3,3,4,0,2,3,1,3,3,3,1,4,1,1,2,4,2,1,3,3,2,1,3,5,
               1,
%U A095840 12,3,2,1,3,2,2,3,2,4,2,1,2,2,0,1,1,3,2,4,2,3,2,0,2,3,1,2,2,2,1,3
%N A095840 Number of ways to write the n-th prime power as sum of two prime powers.
%C A095840 a(n) = A071330(A000961(n)).
%C A095840 See A095842 and A095841 for prime powers having not more than one partition 
               into two prime powers.
%e A095840 A000961(8) = 3^2 = 9 = 1+8 = 2+7 = 4+5, therefore a(8)=3.
%Y A095840 Sequence in context: A162345 A048689 A069923 this_sequence A131343 A089051 
               A108229
%Y A095840 Adjacent sequences: A095837 A095838 A095839 this_sequence A095841 A095842 
               A095843
%K A095840 nonn
%O A095840 1,4
%A A095840 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2004

Search completed in 0.001 seconds