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 A090686 #20 Sep 08 2022 08:45:12
%S A090686 5,23,53,149,293,383,599,863,1013,1733,2399,2903,4373,4703,5399,6143,
%T A090686 7349,8663,11093,12149,16223,18149,20183,21599,23063,23813,25349,
%U A090686 27743,29399,31973,33749,35573,40343,41333,45413,51893,56453,59999,62423
%N A090686 Primes of the form 6n^2 - 1.
%C A090686 Subset of A007528. The values of n for which 6*n^2 - 1 is prime are 1, 2, 3, 5, 7, 8, 10, 12, 13, 17, 20, 22, 27, 28, 30, 32, 35, 38, 43, 45, 52, 55, 58, 60, 62, 63, 65, 68, 70, 73, 75, 77, 82, 83, 87, 93, 97, 100, ... - _Jonathan Vos Post_, Aug 27 2006
%H A090686 Vincenzo Librandi, <a href="/A090686/b090686.txt">Table of n, a(n) for n = 1..5000</a>
%t A090686 lst={};Do[p=6*n^2-1;If[PrimeQ[p],AppendTo[lst,p]],{n,0,3*5!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 27 2009 *)
%t A090686 Select[Table[6n^2-1,{n,0,700}],PrimeQ] (* _Vincenzo Librandi_, Dec 05 2011 *)
%o A090686 (PARI) mx2pmp(n) = { for(x=1,n, y = 6*x^2-1; if(isprime(y),print1(y",")) ) }
%o A090686 (Magma) [a: n in [0..500] | IsPrime(a) where a is 6*n^2-1]; // _Vincenzo Librandi_, Dec 05 2011
%Y A090686 Cf. A000040, A007528, A090687.
%K A090686 easy,nonn
%O A090686 1,1
%A A090686 _Cino Hilliard_, Dec 18 2003
%E A090686 Edited by _N. J. A. Sloane_ at the suggestion of _R. J. Mathar_, Apr 14 2008