a(n) = phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041).

A366581

a(n) = phi(p(n)), where phi is Euler's totient function (A000010) and p(n) is the number of partitions of n (A000041).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =6a(6) =10a(7) =8a(8) =10a(9) =8a(10) =12a(11) =24a(12) =60a(13) =100a(14) =72a(15) =80a(16) =120a(17) =180a(18) =240a(19) =168a(20) =360a(21) =240a(22) =332a(23) =1000a(24) =720a(25) =880a(26) =672a(27) =1008a(28) =1560a(29) =3280

External references