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 A171749 #14 May 13 2013 01:49:12
%S A171749 13,59,137,389,563,769,1277,1579,1913,2677,5147,5737,6359,7013,7699,
%T A171749 9949,12487,13397,15313,16319,18427,20663,23027,26813,32309,36767,
%U A171749 38317,41513,43159,51869,61379,63377,65407,73847,78259,80513,82799,89849
%N A171749 Odd primes of the form (1+n)*(2+2*n)+n*(3+2*n) = 4*n^2+7*n+2.
%C A171749 This sequence is infinite under the Bunyakovsky conjecture. - _Charles R Greathouse IV_, Apr 04 2012
%C A171749 Also primes of the form 16*m^2-2*m-1, by the substitution n=2*m-1. [Note that n is odd because otherwise 4n^2+7n+2 is even]. - _Bruno Berselli_, Jul 03 2012
%H A171749 Vincenzo Librandi, <a href="/A171749/b171749.txt">Table of n, a(n) for n = 1..1000</a>
%t A171749 f[n_] := (1+n)(2+2*n)+n*(3+2*n); lst={}; Do[If[PrimeQ[f[n]], AppendTo[lst, f[n]]], {n, 6!}]; lst
%t A171749 Select[Table[4*n^2+7*n+2,{n, 1000}],PrimeQ] (* _Vincenzo Librandi_, Aug 01 2012 *)
%Y A171749 Cf. A171748.
%K A171749 nonn,easy
%O A171749 1,1
%A A171749 _Vladimir Joseph Stephan Orlovsky_, Dec 17 2009