Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086917 a(n)=Floor[p[n]-log[n]-log[log[n]-1]. +0
1
2, 4, 6, 10, 11, 15, 16, 19, 24, 25, 30, 32, 33, 36, 40, 45, 46, 50, 53, 53, 57, 60, 64, 70, 72, 73, 75, 75, 77, 89, 91, 95, 95, 103, 103, 107, 111, 113, 117, 121, 121, 129, 129, 130, 130, 140, 150, 151, 151, 153, 156, 156, 164, 167, 171, 175, 174, 178, 179, 179, 187 (list; graph; listen)
OFFSET

2,1

COMMENT

Estimation involved seems (by experience) strongly improved because Floor[p[n]-log[n]-log[log[n]-3]>0 for large enough n.

REFERENCES

Dusart,P.[1999]:The k-th prime is greater than k(lnk+lnlnk-1), Math.Comp.68(215), pp. 411-415.

MATHEMATICA

Table[Floor[Prime[w]-w*(Log[w]-Log[Log[w]]-1)//N], {w, 1, 256}]

CROSSREFS

Cf. A000040.

Sequence in context: A056077 A129630 A026429 this_sequence A004789 A027435 A014666

Adjacent sequences: A086914 A086915 A086916 this_sequence A086918 A086919 A086920

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 17 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research