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 A093503 #11 Aug 29 2023 08:57:19
%S A093503 2,3,5,11,17,23,29,37,47,59,71,83,97,113,127,149,167,191,211,233,257,
%T A093503 281,307,331,359,389,419,449,479,509,541,577,613,647,683,719,757,797,
%U A093503 839,881,929,971,1013,1061,1109,1163,1213,1277,1327,1381,1433,1487,1543
%N A093503 a(0) = 2, a(n) = least prime >= a(n-1) + n.
%C A093503 A variant with offset 1 is 2, 5, 11, 17, ... which agrees with this sequence for n > 1.
%H A093503 Paolo Xausa, <a href="/A093503/b093503.txt">Table of n, a(n) for n = 0..10000</a>
%e A093503 a(6) is the least prime >= a(5) + 6 = 23 + 6 = 29, hence a(6) = 29.
%t A093503 A093503list[nmax_]:=Module[{n=0},NestList[NextPrime[#+n++]&,2,nmax]];A093503list[100] (* _Paolo Xausa_, Aug 29 2023 *)
%o A093503 (PARI) p=2;for(n=1,53,print1(p,",");p=nextprime(p+n))
%Y A093503 Cf. A093504.
%K A093503 easy,nonn
%O A093503 0,1
%A A093503 _Amarnath Murthy_, Apr 17 2004
%E A093503 Edited by _Klaus Brockhaus_, Apr 27 2004