cp's OEIS Frontend

A079412 Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.

%I A079412 #3 Mar 30 2012 18:50:30
%S A079412 0,0,0,0,1,0,3,1,3,1,11,1,18,3,7,5,43,2,65,5,24,10,137,4,115,17,84,16,
%T A079412 379,3,519,42,152,47,317,12,1267,73,334,41,2213,9,2897,107,344,174,
%U A079412 4871,32,3733,100,1369,245,10218,51,4037,235,2607,554,20586,23,25792,795
%N A079412 Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.
%C A079412 a(p) = A023894(p) - 1 for p prime.
%e A079412 13 = 11+2 = 3^2+2^2 = 3^2+2+2 = 2^3+5 = 2^3+3+2 = 7+2^2+2 = 7+3+3 = 7+2+2+2 = 5+5+3 = 5+2^2+2^2 = 5+2^2+2+2 = 5+3+3+2 = 5+2+2+2+2 = 2^2+2^2+3+2 = 2^2+3+3+3 = 2^2+3+2+2+2 = 3+3+3+2+2 = 3+2+2+2+2+2, therefore a(13)=18, (A023894(13)=19, A079413(13)=3);
%e A079412 14 = 11+3 = 3^2+5 = 5+3+3+3, therefore a(14)=3, (A023894(14)=23, A079413(14)=2).
%Y A079412 Cf. A079413, A023894, A051613, A000961.
%K A079412 nonn
%O A079412 1,7
%A A079412 _Reinhard Zumkeller_, Jan 07 2003