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!)
A089679 Let g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])]. Then a(n) = (g[n]+g[n+1])-g[n*(n+1)]+1. 0

%I #5 Mar 30 2012 17:34:14

%S 2,2,1,1,2,2,1,0,1,1,1,2,2,1,1,2,1,1,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,

%T 1,1,1,1,1,1,1,2,2,0,0,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,

%U 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,2,1

%N Let g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])]. Then a(n) = (g[n]+g[n+1])-g[n*(n+1)]+1.

%C Log-type weighted average function of primes and the prime distribution.

%C This function makes use of the addition property of logs. The resulting function looks like a log square wave with ringing on the leading edge.

%t digits=200 g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])] b=Table[(g[n]+g[n+1])-g[n*(n+1)]+1, {n, 1, digits}]

%K nonn

%O 1,1

%A _Roger L. Bagula_, Jan 04 2004

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 April 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)