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 A179210 #66 Dec 06 2018 16:34:46
%S A179210 5,3,31,8123,139,199,45439,1933,523,156157,1951,1669,480209,2971,7759,
%T A179210 2181737,12163,28351,6012899,20809,16141,3933599,163063,86629,
%U A179210 13626257,25471,40639,60487759,79699,149629,217795247,625699,552403
%N A179210 a(n) is the smallest prime q such that (r-q)/(q-p) = n, where p<q<r are consecutive primes (or 0 if no such prime exists).
%C A179210 Conjecture: a(n) > 0 for all n >= 1.
%C A179210 It appears that a(3n+1) is greater than either a(3n) or a(3n+2). - _Vladimir Shevelev_ and _Robert G. Wilson v_, Oct 20 2016
%H A179210 Vladimir Shevelev and Robert G. Wilson v, <a href="/A179210/b179210.txt">Table of n, a(n) for n = 1..69</a>
%F A179210 a(n) = nextprime(A181994(n)). - _Robert G. Wilson v_, Dec 23 2016
%t A179210 p = 2; q = 3; r = 5; t[_] = 0; While[p < 10^9, If[ Mod[r - q, q - p] == 0 && t[(r - q)/(q - p)] == 0, t[(r - q)/(q - p)] = q; Print[{(r - q)/(q - p), q}]]; p = q; q = r; r = NextPrime@ r]; t /@ Range @ 40 (* _Robert G. Wilson v_, Dec 11 2016 *)
%t A179210 Table[SelectFirst[Partition[Prime[Range[12010000]],3,1],Differences[#][[2]]/ Differences[#][[1]]==n&],{n,33}][[All,2]] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 05 2018 *)
%o A179210 (PARI) a(n) = forprime(q=3, , my(p=precprime(q-1), r=nextprime(q+1)); if((r-q)/(q-p)==n, return(q))) \\ _Felix Fröhlich_, Dec 06 2018
%Y A179210 For records see A278574.
%Y A179210 Cf. A001223, A179256, A181994.
%K A179210 nonn
%O A179210 1,1
%A A179210 _Vladimir Shevelev_, Jan 05 2011