Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038607
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A038607
%S A038607 2,11,37,127,347,1087,3109,8419,24317,64553,175211,480881,1304707,
%T A038607 3523901,9558533,25874843,70115473,189961529,514272533,1394193607,
%U A038607 3779851091,10246935679,27788566133,75370121191,204475052401
%N A038607 a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) 
               denotes the prime counting function.
%F A038607 a(n) = prime(A038606(n)) = A000040(A038606(n)).
%e A038607 For n=3, the 12th prime (37) is the first one satisfying p(k) > 3k.
%t A038607 k = 1; Do[ While[ Prime[k] < n*k, k++ ]; Print[Prime[k]], {n, 1, 25} 
               ]
%Y A038607 Cf. A038606, A038623.
%Y A038607 Sequence in context: A152819 A140561 A140553 this_sequence A079009 A097651 
               A059673
%Y A038607 Adjacent sequences: A038604 A038605 A038606 this_sequence A038608 A038609 
               A038610
%K A038607 nonn,nice
%O A038607 1,1
%A A038607 Vasiliy Danilov (danilovv(AT)usa.net) 1998 Jul
%E A038607 Extended by Robert G. Wilson v (rgwv(AT)rgwv.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), 
               Dec 01 2004

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research