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!)
A002036 Compressed primes: a(n) is the nearest integer to prime(n)/log prime(n).
(Formerly M2272 N0898)
3
3, 3, 3, 4, 5, 5, 6, 6, 7, 9, 9, 10, 11, 11, 12, 13, 14, 15, 16, 17, 17, 18, 19, 20, 21, 22, 22, 23, 23, 24, 26, 27, 28, 28, 30, 30, 31, 32, 33, 34, 35, 35, 36, 37, 37, 38, 39, 41, 42, 42, 43, 44, 44, 45, 46, 47, 48, 48, 49, 50, 50, 52, 54, 54, 54, 55, 57, 58, 59, 60, 60, 61, 62 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
M. Stein and S. M. Ulam, An Observation on the Distribution of Primes, Amer. Math. Monthly 74, 43-44, 1967.
FORMULA
a(n) = n - O(n/log n). - Charles R Greathouse IV, Nov 30 2022
MATHEMATICA
Table[ Round[ Prime[n] / Log[ Prime[n]]], {n, 1, 75}]
PROG
(PARI) n=0; forprime (p=1, 9999, a=round(p/log(p)); write("b002036.txt", n++, " ", a); if (n>=1000, break)) \\ Harry J. Smith, Jun 16 2009
CROSSREFS
Cf. A070944.
Sequence in context: A240117 A333536 A069941 * A090903 A022878 A022877
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Robert G. Wilson v, May 15 2002
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)