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.

A092968 Numbers n such that 2n^2 + 11 is a prime.

This page as a plain text file.
%I A092968 #25 Feb 16 2025 08:32:53
%S A092968 0,1,2,3,4,5,6,7,8,9,10,13,15,16,18,19,20,23,24,28,29,30,31,37,41,42,
%T A092968 43,46,49,50,52,54,60,62,63,65,69,70,71,75,83,85,87,91,94,95,96,98,
%U A092968 100,106,108,109,114,123,124,128,130,134,136,137,139,145,146,151,152,153,158
%N A092968 Numbers n such that 2n^2 + 11 is a prime.
%H A092968 Vincenzo Librandi and Zak Seidov, <a href="/A092968/b092968.txt">Table of n, a(n) for n = 1..10000</a> (First 1000 terms from Vincenzo Librandi.)
%H A092968 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a>
%F A092968 a(n) = sqrt((A050265(n)-11)/2). - _Zak Seidov_, Jul 25 2015
%t A092968 Select[Range[0, 200], PrimeQ[2#^2+11]&]
%o A092968 (Magma) [n: n in [1..160] | IsPrime(2*n^2 + 11)]; // _Vincenzo Librandi_, Dec 04 2012
%Y A092968 Cf. A050265.
%K A092968 nonn,easy
%O A092968 1,3
%A A092968 _Giovanni Teofilatto_, Apr 20 2004
%E A092968 More terms from _T. D. Noe_, Dec 31 2004