login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090668 a(n)=[prime(n)*(n-pi(n))/(pi(n)+1)], where pi=A000720, [x]=floor(x). 1
2, 1, 1, 4, 5, 9, 10, 15, 23, 34, 31, 43, 41, 49, 60, 75, 73, 83, 81, 94, 105, 122, 116, 133, 155, 171, 185, 203, 188, 205, 211, 229, 251, 266, 298, 314, 301, 326, 346, 372, 358, 374, 369, 386, 407, 424, 422, 459, 482, 500, 524, 552, 524, 561, 589, 618, 648, 669 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A sequence based on the ratios of distributions of primes and composite numbers.
By adding one to the distribution of primes function an initial n=1 singularity is avoided.
LINKS
FORMULA
Asymptotically, a(n) ~ prime(n)*n/pi(n). - M. F. Hasler, Apr 06 2009
r[n_]=(1+PrimePi[n])/(n-PrimePi[n]) a(n) = Floor[(1/r[n])*Prime[n]]
MATHEMATICA
d=237 r[n_]=(1+PrimePi[n])/(n-PrimePi[n]) aa=Table[Floor[(1/r[n])*Prime[n]], {n, 1, d}]
PROG
(PARI) A090668(n)=prime(n)*(n-primepi(n))\(primepi(n)+1) \\ M. F. Hasler, Apr 06 2009
CROSSREFS
Sequence in context: A329689 A270952 A143392 * A307977 A355334 A295259
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Dec 16 2003
EXTENSIONS
Edited by M. F. Hasler, Apr 07 2009
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 05:27 EDT 2024. Contains 372356 sequences. (Running on oeis4.)