A248912 a(n) = floor(prime(n) - (n+1)*(log(n) + log(log(n))) + n) for n > 1.
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, 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, 8, 6, 14, 14, 18, 14, 12, 12, 14, 14, 14, 12, 12, 14, 12, 14
Offset: 2
Keywords
Examples
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.
Links
- Michel Lagneau, Table of n, a(n) for n = 2..20000
Programs
-
Magma
[Floor(NthPrime(n)-(n+1)*(Log(n)+Log(Log(n)))+n): n in [2..80]]; // Vincenzo Librandi, Oct 16 2014
-
Maple
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:
-
Mathematica
Table[Floor[Prime[n]-(n+1)*(Log[n]+Log[Log[n]])+n], {n,2, 100}] -
PARI
a(n) = floor(prime(n)-(n+1)*(log(n)+log(log(n))) + n); \\ Michel Marcus, Mar 05 2022
Comments