The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A102166 Numbers n such that 2*n^2 + 11*n + 101 is prime. 1
 0, 2, 6, 8, 12, 14, 18, 36, 38, 42, 44, 48, 50, 66, 72, 74, 78, 80, 84, 90, 92, 102, 104, 116, 140, 150, 152, 158, 162, 164, 170, 182, 186, 192, 198, 200, 204, 216, 218, 222, 236, 242, 254, 258, 266, 282, 290, 294, 302, 312, 318, 332, 336, 338, 342, 354, 356, 366 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 2 is the smallest one digit prime, 11 is the smallest two digit prime and 101 is the smallest three digit prime. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 EXAMPLE For n=0, 2*n^2 + 11*n + 101 = 2*0^2 + 11*0 + 101 = 101 (prime) for n=48, 2*n^2 + 11*n + 101 = 2*48^2 + 11*48 + 101 = 5237 (prime) for n=92, 2*n^2 + 11*n + 101 = 2*92^2 + 11*92 + 101 = 18041 (prime) MATHEMATICA Select[Range[0, 400], PrimeQ[2#^2+11#+101]&] (* Harvey P. Dale, Aug 16 2020 *) PROG (Magma) [n: n in [0..1000] | IsPrime(2*n^2 + 11*n + 101)] // Vincenzo Librandi, Nov 18 2010 (PARI) is(n)=isprime(2*n^2+11*n+101) \\ Charles R Greathouse IV, Jun 13 2017 CROSSREFS Sequence in context: A111367 A105059 A108187 * A024894 A153880 A120227 Adjacent sequences: A102163 A102164 A102165 * A102167 A102168 A102169 KEYWORD nonn,easy AUTHOR Parthasarathy Nambi, Feb 15 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 09:35 EST 2022. Contains 358585 sequences. (Running on oeis4.)