login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079715 a(n) = Pi(n)-Pi(sqrt(n)) + 1 0

%I

%S 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,

%T 9,9,10,10,10,10,11,11,12,12,12,12,13,13,12,12,12,12,13,13,13,13,13,

%U 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

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

%C a(n)=sum( d' dividing n, mu(d')*floor(n/d')) where each prime factor of d' is <=sqrt(n).

%C A well-known application of the principle of inclusion-exclusion used in sieve methods.

%C 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_, Mar 17 2005

%F a(n) = pi(n) - pi(sqrt(n)) + 1 = A000720(n) - A056811(n) + 1 = A056812(n) + 1.

%Y Cf. A000720, A056811.

%K nonn

%O 1,2

%A _Benoit Cloitre_, Feb 16 2003

%E Edited by _N. J. A. Sloane_ at the suggestion of _Andrew Plewe_, Jun 12 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 09:15 EST 2016. Contains 278762 sequences.