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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089680 Let g[n_]=(Prime[n]-n)/(n-PrimePi[n]). Then a(n) = Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]]. 0
 3, 3, 1, 2, 4, 3, 3, 1, 2, 2, 3, 4, 4, 2, 2, 3, 4, 4, 4, 3, 2, 3, 3, 3, 3, 3, 2, 2, 2, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Exponential version of log like weighted average function of primes and the prime distribution. LINKS Table of n, a(n) for n=1..105. MATHEMATICA digits=200 g[n_]=(Prime[n]-n)/(n-PrimePi[n]) b=Table[Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]], {n, 1, digits}] CROSSREFS Sequence in context: A255941 A010264 A262816 * A309507 A306690 A160326 Adjacent sequences: A089677 A089678 A089679 * A089681 A089682 A089683 KEYWORD nonn AUTHOR Roger L. Bagula, Jan 04 2004 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.

Last modified May 30 07:21 EDT 2023. Contains 363045 sequences. (Running on oeis4.)