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 A308082 #19 Jun 02 2025 15:21:57
%S A308082 4,11,30,68,72,180,189,442,1051,1059,2700,6454,6458,6465,6472,15927,
%T A308082 40072,40121,100361,100363,251706,251709,251723,251737,251761,637234,
%U A308082 637320,637323,637330,637340,1617174,4124436,4124466,4124472,4124705,10553414
%N A308082 Numbers k such that floor(prime(k)/k) < floor(prime(k+1)/(k+1)).
%C A308082 Largest k below 10^8 is 69709965.
%C A308082 If instead of "less than" in floor(prime(k)/k) < floor(prime(k+1)/(k+1)), we use "greater than", we get A283053.
%t A308082 Select[Range@100000, Floor[Prime@#/#] < Floor[Prime[# + 1]/(# + 1)] &]
%o A308082 (PARI) isok(k) = prime(k)\k < prime(k+1)\(k+1); \\ _Michel Marcus_, May 11 2019
%o A308082 (PARI) lista(nn) = {my(p=2, ip=1, q=3); for (n=1, nn, if (p\ip < q\(ip+1), print1(ip, ", ")); p = q; ip ++; q = nextprime(p+1););} \\ _Michel Marcus_, May 11 2019
%Y A308082 Cf. A000040, A038605, A283053.
%K A308082 nonn
%O A308082 1,1
%A A308082 _Giorgos Kalogeropoulos_, May 11 2019