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 A230666 #11 Dec 09 2013 17:19:40
%S A230666 5,149,29401,5821349,8946229758127349,1771308307978070401,
%T A230666 13748537282247342677718149,106713369180271088592919391520601,
%U A230666 828287615476676026361062299923143963349,32470531080787945457870876690417952137154149
%N A230666 Primes p such that a Heronian triangle with a fixed side length of 3 contains p as another side length.
%C A230666 The triangle inequality requires that any integer triangle with a fixed side length of 3 can have remaining side lengths of (x, x+1) or (x, x+2). The constraint that primitive Heronian triangles have only one even side will just permit (x, x+1). So a(n) = x or x+1 whenever the Heronian triangle has x or x+1 as a prime and n is the ordered occurrence of this prime. The ordered sequence of x is given by A072221 where x(n) = 6x(n-1)-x(n-2)+2, x(0)=1, x(1)=4 starting at x(1).
%F A230666 Primes of the form x(m) or x(m)+1 where x(m) is given by x(m) = 6x(m-1)-x(m-2)+2, x(0)=1, x(1)=4 starting at x(1).
%e A230666 a(2)=149 because the triangle with sides (3, 148, 149) is Heronian, 149 is prime and is the 2nd occurrence of such a prime with triangle sides (3, 4, 5) giving 5 as the 1st occurrence.
%t A230666 seq[n_] := seq[n] = Which[n==0, 1, n==1, 4, True, 6seq[n-1]-seq[n-2]+2]; lst={}; Do[Which[PrimeQ[seq[m]], AppendTo[lst, seq[m]], PrimeQ[seq[m]+1], AppendTo[lst, seq[m]+1], True, Null], {m, 1, 500}]; lst
%t A230666 t = LinearRecurrence[{7, -7, 1}, {1, 4, 25}, 100]; Select[Union[t, t + 1], PrimeQ[#] &] (* _T. D. Noe_, Dec 09 2013 *)
%Y A230666 Cf. A072221.
%K A230666 nonn
%O A230666 1,1
%A A230666 _Frank M Jackson_, Oct 27 2013