A070298 Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n.

3, 0, 3, 2, 2, 2, 2, 1, 3, 1, 4, 2, 0, 2, 3, 4, 3, 2, 1, 3, 2, 4, 4, 2, 2, 4, 2, 2, 3, 4, 1, 4, 1, 2, 3, 3, 1, 4, 5, 4, 3, 3, 1, 5, 2, 5, 1, 3, 2, 7, 3, 5, 1, 3, 3, 7, 3, 4, 3, 5, 1, 6, 2, 2, 3, 5, 0, 6, 2, 6, 4, 6, 2, 8, 1, 5, 2, 5, 2, 9, 4, 5, 1, 4, 1, 9, 5, 5

Offset: 1

Author

Amarnath Murthy, May 10 2002

Keywords

• nonn

Comments

a(0), not included in the sequence, is infinite, as no prime has any unrelated number.

Apparently this gives the indices k such that A045763(k)=n. - R. J. Mathar, Jun 27 2007

Examples

			a(1) = 3, the three numbers m being 6,8 and 9. The corresponding single unrelated numbers are 4, 6 and 6 respectively.
		

Links

• Jinyuan Wang, Table of n, a(n) for n = 1..5000

Crossrefs

Cf. A045763, A070297.

Extensions

Corrected and extended by R. J. Mathar, Jun 27 2007

More terms from Jinyuan Wang, May 25 2020