This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A295405 a(n) = 1 if n^2+1 is prime, 0 otherwise. 1
 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1 COMMENTS It is conjectured that n^2+1 is prime infinitely often. LINKS Simon Plouffe, Table of n, a(n) for n =1.. 10000 FORMULA a(n) = A010051(A002522(n)). - Robert Israel, Nov 22 2017 EXAMPLE With n=1, a(1) = 2, n=2, a(2) = 5, a(3) = 0 since 10 is not prime. MAPLE seq(`if`(isprime(n^2+1), 1, 0), n=1..100); # Robert Israel, Nov 22 2017 PROG (PARI)  a(n)=if(isprime(n^2+1), 1) for (n = 1, 1000, print(a(n))) CROSSREFS Cf. A002496, A002522, A010051. Sequence in context: A147612 A323509 A197183 * A267001 A141735 A322585 Adjacent sequences:  A295402 A295403 A295404 * A295406 A295407 A295408 KEYWORD nonn AUTHOR Simon Plouffe, Nov 22 2017 STATUS approved

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

Last modified December 12 15:11 EST 2019. Contains 329960 sequences. (Running on oeis4.)