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!)
A064662 a(n) = n - round( prime(n)/log(prime(n)) ). 2

%I #15 Sep 08 2022 08:45:04

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

%T 6,5,6,6,6,6,6,6,7,7,7,8,8,8,7,7,8,8,8,9,9,9,9,9,10,10,10,11,10,9,10,

%U 11,11,10,10,10,10,11,11,11,11,11,12,12,12,12,12,12,12

%N a(n) = n - round( prime(n)/log(prime(n)) ).

%H Harry J. Smith, <a href="/A064662/b064662.txt">Table of n, a(n) for n = 1..1000</a>

%t rpl[n_]:=Module[{p=Prime[n]},n-Round[p/Log[p]]]; Array[rpl,90] (* _Harvey P. Dale_, May 20 2019 *)

%o (PARI) { for (n=1, 1000, write("b064662.txt", n, " ", n - round( prime(n)/log(prime(n)) )) ) } \\ _Harry J. Smith_, Sep 21 2009

%o (Magma) [n - Round(NthPrime(n) / Log(NthPrime(n))): n in [1..100]]; // _Vincenzo Librandi_, May 25 2019

%Y Cf. A064659-A064663.

%K sign

%O 1,1

%A _N. J. A. Sloane_, Oct 10 2001

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)