a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).

A061468

a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).

Terms

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

External references