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 A283053 #16 Jul 23 2025 18:45:17 %S A283053 69,181,1052,6457,6460,6466,40083,100362,251707,251722,251736,251741, %T A283053 637236,637322,637326,637333,4124458,4124467,4124587,10553439, %U A283053 10553444,10553454,10553478,10553502,10553505,10553547,10553568,10553573,10553575,10553818,10553827 %N A283053 Numbers k such that A068902(k+1) <= A068902(k). %C A283053 Numbers k for which k*floor(ceiling(prime(k+1)/(k+1))*(1+1/k)) < prime(k). %e A283053 For n=1, A068902(69) = 414 <= A068902(70) = 350. %t A283053 Flatten@ Position[Differences@ Table[n Ceiling[Prime@ n/n], {n, 10^7}], k_ /; k <= 0] (* _Michael De Vlieger_, Feb 27 2017 *) %o A283053 (MATLAB) %o A283053 P = primes(10^8); %o A283053 N = numel(P); %o A283053 R = [1:N] .* ceil(P ./ [1:N]); %o A283053 Rd = R(2:end) - R(1:end-1); %o A283053 find(Rd <= 0) %Y A283053 Cf. A068902. %K A283053 nonn %O A283053 1,1 %A A283053 _Robert Israel_, Feb 27 2017 %E A283053 More terms from _Michael De Vlieger_, Feb 27 2017