cp's OEIS Frontend

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.

A002970 Numbers k such that 4*k^2 + 9 is prime.

This page as a plain text file.
%I A002970 M3248 #31 Oct 21 2023 01:07:43
%S A002970 1,4,5,10,16,19,20,26,29,31,35,41,44,49,50,55,56,59,70,71,80,85,94,95,
%T A002970 100,101,106,109,110,121,149,154,160,166,175,179,184,190,191,200,205,
%U A002970 206,211,224,236,241,245,251,256,265,269,271,284,286,289,299,304,314
%N A002970 Numbers k such that 4*k^2 + 9 is prime.
%D A002970 E. Kogbetliantz and A. Krikorian, Handbook of First Complex Prime Numbers, Gordon and Breach, NY, 1971, p. 1.
%D A002970 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002970 T. D. Noe, <a href="/A002970/b002970.txt">Table of n, a(n) for n = 1..1000</a>
%H A002970 E. Kogbetliantz and A. Krikorian <a href="/A002970/a002970.pdf">Handbook of First Complex Prime Numbers</a>, Gordon and Breach, NY, 1971. [Annotated scans of a few pages]
%t A002970 Select[Range[350], PrimeQ[4 #^2 + 9] &] (* _Vincenzo Librandi_, Mar 19 2014 *)
%o A002970 (Magma)[n: n in [0..600]|IsPrime(4*n^2+9)]; // _Vincenzo Librandi_, Nov 21 2010
%o A002970 (PARI) is(n)=isprime(4*n^2+9) \\ _Charles R Greathouse IV_, Feb 17 2017
%K A002970 nonn,easy
%O A002970 1,2
%A A002970 _N. J. A. Sloane_