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

A079413

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

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =1a(5) =0a(6) =2a(7) =1a(8) =2a(9) =1a(10) =3a(11) =1a(12) =3a(13) =2a(14) =3a(15) =3a(16) =3a(17) =2a(18) =5a(19) =3a(20) =4a(21) =3a(22) =9a(23) =3a(24) =5a(25) =4a(26) =6a(27) =4a(28) =18a(29) =3

External references