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.
%I A062742 #24 Oct 07 2022 23:59:54 %S A062742 2,1,12,31,69,181,443,1052,2701,6455,15928,40073,100362,251707,637235, %T A062742 1617175,4124437,10553415,27066974,69709680,179992909,465769803, %U A062742 1208198526,3140421716,8179002096,21338685407,55762149030,145935689361 %N A062742 Index j of prime p(j) such that floor(p(j)/j) = n is first satisfied. %H A062742 Giovanni Resta, <a href="/A062742/b062742.txt">Table of n, a(n) for n = 1..50</a> %F A062742 a(n) = Min_{j| floor(p(j)/j) = n}. Note that neither p(j)/j nor floor(p(j)/j) is monotonic. %F A062742 a(n) = pi(A062743(n)). %F A062742 a(n) = A038606(n) = A038624(n) for n >= 3. - _Jaroslav Krizek_, Dec 13 2009 %e A062742 The q(j)=p(j)/j quotient when the value 14 first appears: {j=251706, p(j)=3523841, q(j)=13.9998291} {251707, 3523901, 14.0000119} {251708, 3523903, 13.9999642} {251709, 3523921, 13.9999801} {251710, 3523957, 14.0000675} {251711, 3523963, 14.0000357} %o A062742 (PARI) {a062742(m)=local(n,j); for(n=1,m,j=1; while(floor(prime(j)/j)!=n,j++); print1(j,","))} a062742(10^7) %Y A062742 Essentially the same as A038624. %Y A062742 Cf. A038606. - _R. J. Mathar_, Jan 30 2009 %K A062742 nonn %O A062742 1,1 %A A062742 _Labos Elemer_, Jul 12 2001 %E A062742 More terms from _Jason Earls_, May 15 2002 %E A062742 a(17)-a(28) from _Farideh Firoozbakht_ and _Robert G. Wilson v_, Sep 13 2005 %E A062742 a(29)-a(50) obtained from the values of A038625 computed by _Jan Büthe_. - _Giovanni Resta_, Sep 01 2018