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 A065521 #13 Dec 27 2019 19:28:00
%S A065521 2,1,1,1,9,11,11,13,13,11,13,35,37,41,43,43,43,47,47,49,53,53,55,55,
%T A065521 53,55,59,61,65,67,121,125,127,133,131,137,139,141,145,147,149,155,
%U A065521 153,159,163,169,165,161,165,171,175,177,183,181,183,185,187,193,195,199
%N A065521 a(n) = floor(prime(n) / n) * n - prime(n) mod n.
%H A065521 Harry J. Smith, <a href="/A065521/b065521.txt">Table of n, a(n) for n = 1..1000</a>
%F A065521 a(n) = A038605(n) * n - A004648(n).
%t A065521 Table[Floor[Prime[n]/n]n-Mod[Prime[n],n],{n,60}] (* _Harvey P. Dale_, Dec 27 2019 *)
%o A065521 (PARI) { for (n=1, 1000, a=floor(prime(n) / n) * n - prime(n) % n; write("b065521.txt", n, " ", a) ) } \\ _Harry J. Smith_, Oct 20 2009
%o A065521 (PARI) a(n) = n*(prime(n)\n) - (prime(n) % n); \\ _Michel Marcus_, Jun 18 2018
%Y A065521 Cf. A038605, A004648.
%K A065521 nonn
%O A065521 1,1
%A A065521 _Reinhard Zumkeller_, Nov 27 2001