cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A038623 Smallest prime p such that p/pi(p)>=n.

This page as a plain text file.
%I A038623 #30 Aug 05 2025 14:18:33
%S A038623 2,2,37,127,347,1087,3109,8419,24317,64553,175211,480881,1304707,
%T A038623 3523901,9558533,25874843,70115473,189961529,514272533,1394193607,
%U A038623 3779851091,10246935679,27788566133,75370121191,204475052401,554805820711,1505578023841,4086199302113
%N A038623 Smallest prime p such that p/pi(p)>=n.
%H A038623 Giovanni Resta, <a href="/A038623/b038623.txt">Table of n, a(n) for n = 1..50</a>
%F A038623 a(n) = exp(n + 1 + o(1)). - _Charles R Greathouse IV_, Oct 15 2016
%e A038623 pi(37)=12 and a(3)=37 is the smallest prime >= 3*12.
%t A038623 Prime[Join[{k = 1}, Table[While[Prime[k]/k < n, k++]; k, {n, 2, 18}]]] (* _Jayanta Basu_, Jul 10 2013 *)
%o A038623 (PARI) k=n=1; forprime(p=2,, while(p/k>=n, print1(p", "); n++); k++) \\ _Charles R Greathouse IV_, Oct 15 2016
%Y A038623 Cf. A038624-A038627.
%Y A038623 Essentially the same as A062743,A038607.
%Y A038623 a(n) = prime(A038624(n)).
%K A038623 nonn
%O A038623 1,1
%A A038623 _Jud McCranie_
%E A038623 Edited by _N. J. A. Sloane_, Jun 30 2008 at the suggestion of _R. J. Mathar_
%E A038623 a(24)-a(28) from _David W. Wilson_, Apr 25 2017
%E A038623 a(29)-a(50) obtained from the values of A038625 computed by _Jan Büthe_. - _Giovanni Resta_, Sep 01 2018