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 A060981 #20 Jun 01 2019 09:36:15
%S A060981 1373,1447,1097,1163,853,911,641,691,461,503,313,347,197,223,113,131,
%T A060981 61,71,41,43,53,47,97,83,173,151,281,251,421,383,593,547,797,743,1033,
%U A060981 971,1301,1231,1601,1523,1933,1847,2297,2203,2693,2591,3121,3011,3581
%N A060981 Primes of the form 4k^2 - 152k + 1487 + (6k - 114)*(-1)^k.
%C A060981 Generates distinct values, the first 61 of which (i.e., those corresponding to k = 0..60) are primes.
%H A060981 Harry J. Smith, <a href="/A060981/b060981.txt">Table of n, a(n) for n = 1..1000</a>
%t A060981 lst={};Do[p=4*n^2-152*n+1487+(6*n-114)*(-1)^n;If[PrimeQ[p],AppendTo[lst,p]],{n,0,5!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 28 2009 *)
%t A060981 Select[Table[4n^2-152n+1487+(6n-114)(-1)^n,{n,0,50}],PrimeQ] (* _Harvey P. Dale_, Sep 15 2011 *)
%o A060981 (PARI) { n=0; for (m=0, 10000, p=4*m^2 - 152*m + 1487 + (6*m - 114)*(-1)^m; if (isprime(p), write("b060981.txt", n++, " ", p); if (n==1000, break)); ) } \\ _Harry J. Smith_, Jul 15 2009
%Y A060981 Cf. A005846.
%K A060981 nonn,easy
%O A060981 1,1
%A A060981 _Tito Piezas III_, May 11 2001