Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).

A079124

Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =2a(6) =0a(7) =4a(8) =1a(9) =5a(10) =1a(11) =11a(12) =0a(13) =17a(14) =4a(15) =13a(16) =13a(17) =37a(18) =2a(19) =53a(20) =13a(21) =51a(22) =35a(23) =103a(24) =10a(25) =135a(26) =78a(27) =167a(28) =89a(29) =255

External references