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!)
A248912 a(n) = floor(prime(n) - (n+1)*(log(n) + log(log(n))) + n) for n > 1. 1

%I #19 Mar 05 2022 14:16:54

%S 4,3,2,3,2,3,1,2,4,2,4,4,2,2,4,6,3,5,5,2,3,3,4,7,7,4,3,0,-1,8,7,8,5,

%T 10,7,7,8,7,8,8,5,10,6,5,1,8,14,13,9,8,8,5,9,9,10,10,6,7,5,1,5,13,12,

%U 8,6,14,14,18,14,12,12,14,14,14,12,12,14,12,14

%N a(n) = floor(prime(n) - (n+1)*(log(n) + log(log(n))) + n) for n > 1.

%C The function log gives the natural logarithm (to base e).

%C a(30) = -1 is the unique negative value.

%C See A059112 for floor( prime(n) - n*log(n) - n*log(log(n)) + n ) where prime(n) is the n-th prime.

%H Michel Lagneau, <a href="/A248912/b248912.txt">Table of n, a(n) for n = 2..20000</a>

%e a(8) = 1 because floor(prime(8)-(8+1)*(log(8)+log(log(8))) + 8) = floor(19-9*(2.0794415...+0.7320993...) + 8) = floor(1.6961318...) = 1.

%p with(numtheory):for n from 1 to 200 do:p:=floor(evalf(ithprime(n)-(n+1)*ln(n)- (n+1)*ln(ln(n)) + n)): printf(`%d, `,p):od:

%t Table[Floor[Prime[n]-(n+1)*(Log[n]+Log[Log[n]])+n], {n,2, 100}]

%o (Magma) [Floor(NthPrime(n)-(n+1)*(Log(n)+Log(Log(n)))+n): n in [2..80]]; // _Vincenzo Librandi_, Oct 16 2014

%o (PARI) a(n) = floor(prime(n)-(n+1)*(log(n)+log(log(n))) + n); \\ _Michel Marcus_, Mar 05 2022

%Y Cf. A000040, A059111, A059112, A248911.

%K sign

%O 2,1

%A _Michel Lagneau_, Oct 16 2014

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 July 30 15:25 EDT 2024. Contains 374766 sequences. (Running on oeis4.)