A077614 Let F(m,k) = the # of positive integers j<= m and GCD(j,k) = 1. Sequence gives a(n) = # of positive integers k : F(m,k)=k.

1, 0, 1, 2, 0, 1, 1, 2, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 0, 1, 0, 0, 1, 2, 1, 1, 0, 1, 0, 1, 3, 3, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 1, 1, 0, 2, 3, 2, 1, 1, 0, 0, 1, 0, 2, 2, 1, 1, 1, 0, 1, 0, 0, 2, 3, 0, 2, 1, 0, 0, 0, 1, 3, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 0, 0, 0, 0, 2, 2, 1, 2, 2, 1, 0, 1, 0, 1, 0