id:A079715 - OEIS Search Results

Search: id:A079715

Displaying 1-1 of 1 results found.

page 1

a(n) = Pi(n)-Pi(sqrt(n)) + 1

+0
1

1, 2, 3, 2, 3, 3, 4, 4, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n)=sum( d' dividing n, mu(d')*floor(n/d')) where each prime factor of d' is <=sqrt(n).` `A well-known application of the principle of inclusion-exclusion used in sieve methods.` `Number of numbers less than or equal to n and coprime to the product of the primes less than sqrt(n), i.e. to A104588(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), Mar 17 2005`
	FORMULA	`a(n) = pi(n) - pi(sqrt(n)) + 1 = A000720(n) - A056811(n) + 1 = A056812(n) + 1.`
	CROSSREFS	`Cf. A000720, A056811.` `Adjacent sequences: A079712 A079713 A079714 this_sequence A079716 A079717 A079718` `Sequence in context: A086389 A128622 A026256 this_sequence A030397 A082597 A112212`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 16 2003`
	EXTENSIONS	`Edited by njas at the suggestion of Andrew Plewe, Jun 12 2007`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research