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 A082893 #11 Apr 23 2025 11:49:24
%S A082893 2,4,6,8,10,12,14,16,27,30,33,36,39,42,45,48,51,54,76,80,63,88,92,96,
%T A082893 100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,160,164,
%U A082893 168,172,176,180,184,188,240,245,250,255,260,265,270,275,280,285,290
%N A082893 a(n) is the closest number to n-th prime which is divisible by n.
%F A082893 a(n)=n*floor[(floor(n/2)+p(n))/n], where p(n) is the n-th prime.
%e A082893 24th prime, 89 is between 72 and 96, closer to 96, so a(24)=96;
%e A082893 25th prime, 97 is between 75 and 100, closer to 100, so a(25)=100.
%t A082893 Table[n*Floor[(Floor[n/2]+Prime[n])/n], {n, 1, 100}]
%o A082893 (Python)
%o A082893 from sympy import prime
%o A082893 def A082893(n): return (m:=prime(n)+(n>>1))-m%n # _Chai Wah Wu_, Apr 23 2025
%Y A082893 Cf. A082894-A082900.
%K A082893 nonn
%O A082893 1,1
%A A082893 _Labos Elemer_, Apr 22 2003