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 A002732 M3281 N1324 #25 Oct 20 2023 09:46:15 %S A002732 4,6,11,14,21,24,26,29,31,39,44,46,51,54,76,79,89,94,99,101,111,119, %T A002732 124,129,131,136,146,149,154,156,164,176,179,181,194,201,211,214,229, %U A002732 231,239,244,246,254,261,279,286,294,301,311,314,319,326,331,346,349 %N A002732 Numbers k such that (4*k^2 + 1)/5 is prime. %D A002732 L. Euler, De numeris primis valde magnis (E283), reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 3, p. 24. %D A002732 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002732 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002732 Vincenzo Librandi, <a href="/A002732/b002732.txt">Table of n, a(n) for n = 1..1000</a> %H A002732 L. Euler, <a href="http://eulerarchive.maa.org/pages/E283.html">De numeris primis valde magnis (E283)</a>, The Euler Archive. %t A002732 Select[Range[0, 400], PrimeQ[(4 #^2 + 1)/5] &] (* _Vincenzo Librandi_, Sep 25 2012 *) %o A002732 (Magma) [n: n in [4..410] | IsPrime((4*n^2+1) div 5)]; // _Vincenzo Librandi_, Sep 25 2012 %o A002732 (PARI) is(n)=isprime((4*n^2+1)/5) \\ _Charles R Greathouse IV_, May 22 2017 %K A002732 nonn,easy %O A002732 1,1 %A A002732 _N. J. A. Sloane_