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.

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

Offset

1,4

Links

Table of n, a(n) for n=1..105.

Crossrefs

Cf. A077615 (least inverse), A275257 (the F array).

Sequence in context: A199954 A333580 A219987 * A336396 A280379 A333307

Adjacent sequences: A077611 A077612 A077613 * A077615 A077616 A077617

Keyword

nonn

Author

Christian G. Bower and Leroy Quet, Nov 11 2002

Extensions

Name edited by Jon E. Schoenfield, Oct 27 2019

Status

approved