|
%I #10 Feb 17 2019 23:25:48
%S 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,
%T 3,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,
%U 5,1,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 Number of ways to write the n-th prime power as sum of two prime powers.
%C a(n) = A071330(A000961(n)).
%C See A095842 and A095841 for prime powers having no more than one partition into two prime powers.
%H Reinhard Zumkeller, <a href="/A095840/b095840.txt">Table of n, a(n) for n = 1..10000</a>
%e A000961(8) = 3^2 = 9 = 1+8 = 2+7 = 4+5, therefore a(8)=3.
%o (Haskell)
%o a095840 = a071330 . a000961 -- _Reinhard Zumkeller_, Jan 11 2013
%K nonn
%O 1,4
%A _Reinhard Zumkeller_, Jun 10 2004
|
