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 A068902 #18 Sep 08 2022 08:45:05
%S A068902 2,4,6,8,15,18,21,24,27,30,33,48,52,56,60,64,68,72,76,80,84,88,92,96,
%T A068902 100,104,108,112,116,120,155,160,165,170,175,180,185,190,195,200,205,
%U A068902 210,215,220,225,230,235,240,245,250,255,260
%N A068902 Least multiple of n not less than the n-th prime.
%H A068902 Robert Israel, <a href="/A068902/b068902.txt">Table of n, a(n) for n = 1..10000</a>
%F A068902 a(n) = A000040(n) + A068901(n).
%F A068902 a(n) = n*ceiling(prime(n)/n). - _Vladeta Jovovic_, Apr 06 2003
%p A068902 seq(n*ceil(ithprime(n)/n),n=1..60); # _Robert Israel_, Feb 27 2017
%t A068902 Table[n Ceiling[Prime@ n/n], {n, 60}] (* _Michael De Vlieger_, Feb 27 2017 *)
%o A068902 (PARI) vector(60, n, n*ceil(prime(n)/n) ) \\ _G. C. Greubel_, Jun 09 2019
%o A068902 (Magma) [n*Ceiling(NthPrime(n)/n): n in [1..60]]; // _G. C. Greubel_, Jun 09 2019
%o A068902 (Sage) [n*ceil(nth_prime(n)/n) for n in (1..60)] # _G. C. Greubel_, Jun 09 2019
%K A068902 nonn
%O A068902 1,1
%A A068902 _Reinhard Zumkeller_, Mar 05 2002