This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088759 Numbers n such that (4n+3)^2 + (4n+2)^2 is prime. 2
 0, 3, 5, 7, 8, 10, 12, 17, 20, 22, 25, 27, 30, 32, 38, 40, 43, 50, 55, 57, 72, 82, 83, 85, 97, 102, 107, 108, 110, 112, 113, 115, 118, 122, 123, 128, 133, 140, 147, 150, 160, 168, 173, 175, 177, 183, 187, 192, 198, 200, 203, 207, 212, 213, 217, 218, 220, 225, 230 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numbers n such that 32n^2+40n+13 is prime.- Vincenzo Librandi, Dec 12 2011 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..5000 MATHEMATICA Select[Range[0, 400], PrimeQ[32#^2+40 #+13]&] (* Vincenzo Librandi, Dec 12 2011 *) PROG (PARI) isA088759(n)=isprime((4*n+3)^2+(4*n+2)^2) [From Michael B. Porter, Apr 15 2010] (MAGMA) [n: n in [0..300] | IsPrime(32*n^2+40*n+13)]; // Vincenzo Librandi, Dec 12 2011 CROSSREFS Cf. A087872. Sequence in context: A191230 A191202 A024977 * A195439 A190719 A187224 Adjacent sequences:  A088756 A088757 A088758 * A088760 A088761 A088762 KEYWORD nonn,easy AUTHOR Ray Chandler, Oct 19 2003 EXTENSIONS The first term 0 added by Vincenzo Librandi, Dec 12 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 23:42 EDT 2013. Contains 226416 sequences.