Let F(m,k) be the number of positive integers j <= m such that gcd(j,k) = 1; then a(n) is the number of positive integers k such that F(n,k) = k.

A077614

Let F(m,k) be the number of positive integers j <= m such that gcd(j,k) = 1; then a(n) is the number of positive integers k such that F(n,k) = k.

Terms

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

External references