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 A070865 #17 May 01 2015 08:15:25
%S A070865 2,3,5,11,19,29,41,59,79,101,127,157,191,227,269,313,359,409,461,521,
%T A070865 587,659,733,809,887,967,1049,1151,1259,1373,1489,1607,1733,1861,1993,
%U A070865 2129,2267,2411,2557,2707,2861,3019,3181,3347,3517,3691,3877,4073,4271
%N A070865 Smallest prime such that the difference of successive terms is strictly increasing.
%C A070865 The slowest increasing sequence of primes with strictly increasing difference of successive terms. - _Zak Seidov_ and _Charles R Greathouse IV_, May 01 2015
%H A070865 T. D. Noe, <a href="/A070865/b070865.txt">Table of n, a(n) for n = 1..10000</a>
%F A070865 a(n) >> n^2. - _Charles R Greathouse IV_, Apr 30 2015
%t A070865 d=0; p=2; t={p}; Do[d=NextPrime[p+d]-p; AppendTo[t,p+=d], {99}]; t (* _Vladimir Joseph Stephan Orlovsky_, May 29 2010 *)
%t A070865 nxt[{a_,b_}]:={b,NextPrime[2b-a]}; Transpose[NestList[nxt,{2,3},50]][[1]] (* _Harvey P. Dale_, Jan 04 2015 *)
%o A070865 (PARI) t=0; print1(last=2); while(1, n=last+t; while(!isprime(n++), ); print1(", "n); t=n-last; last=n) \\ _Charles R Greathouse IV_, Apr 30 2015
%Y A070865 Cf. A070866.
%K A070865 nonn
%O A070865 1,1
%A A070865 _Amarnath Murthy_, May 16 2002
%E A070865 Corrected and extended by _Lior Manor_, Jun 02 2002