A057604 -id:A057604 - cp's OEIS frontend

A057605 Nonnegative n such that 4*n^2 + 163 is prime.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 24, 25, 27, 28, 29, 31, 32, 33, 34, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 64, 67, 69, 70, 71, 72, 74, 77, 78, 79, 80, 81, 82, 84, 85, 88, 89, 90, 91, 92

Offset: 1

N. J. A. Sloane, Oct 08 2000

nonn

Vincenzo Librandi, Table of n, a(n) for n = 1..2000

Cf. A057604.

[n: n in [0..100] | IsPrime( 4*n^2 + 163 )]; // Vincenzo Librandi, Aug 15 2014

a := []; for n from 0 to 500 do if isprime(4*n^2+163) then a := [op(a), n]; fi; od: a;

Select[Range[0,100],PrimeQ[4#^2+163]&] (* Harvey P. Dale, Aug 14 2014 *)

More terms from James R. Buddenhagen, Mar 03 2001

A175233 Numbers n with property that n and 4*n^2 + 163 are terms in A057605.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 16, 19, 24, 27, 28, 29, 33, 39, 45, 49, 58, 64, 69, 74, 80, 81, 82, 89, 97, 104, 110, 113, 114, 121, 127, 128, 132, 141, 150, 154, 160, 165, 169, 171, 180, 193, 197, 208, 212, 217, 220, 222, 227, 232, 233, 244, 253, 264, 269, 275

Offset: 1

Zak Seidov, Mar 09 2010

nonn

Numbers n with property that both m=4*n^2 + 163 and p=4*m^2 + 163 are primes.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Intersection of A057604 and A057605.

mpQ[n_]:=Module[{m=4n^2+163},And@@PrimeQ[{m,4m^2+163}]]; Select[Range[300], mpQ] (* Harvey P. Dale, Jul 15 2013 *)

n = 2: m = 4*n^2 + 163 = 179 and p = 4*m^2 + 163 = 128327 are primes.

Edited by Zak Seidov, Mar 17 2010

A356751 Positive integers m such that x^2 - x + m contains more than m/2 prime numbers for x = 1, 2, ..., m.

Original entry on oeis.org

3, 5, 7, 11, 17, 41, 47, 59, 67, 101, 107, 161, 221, 227, 347, 377

Offset: 1

Marco Ripà, Aug 25 2022

This sequence is related to A188424, since we are considering only the addends m := 2n - 1 of k^2 + k + 2n - 1 such that A188424(n)/(2n - 1) > 1/2.
Furthermore, it is conjectured that the present sequence consists of only 16 terms (it has been checked by brute force that there are only 16 terms which are smaller than 20000) and that they are all prime or semiprime (e.g., a(12) = 161, a(13) = 221, and a(16) = 377 are semiprime). Lastly, we trivially point out that all terms must be odd, since if m is even, then x^2 - x + m is also even (and x^2 - x + 2 has only one prime for x <= 2).
For an explanation of the abundance of primes of the form x^2 - x + m, for some given m, see Goudsmit's paper in Links.
Stronger conjecture: for every real number e > 0 and every integer m > 0, there are finitely many integer polynomials P(x) = Ax^2 + Bx + C with at least e*m primes in P(1), ..., P(m) and max(|A|, |B|, |C|) <= m. - Charles R Greathouse IV, Sep 11 2022
Altering the bounds for x in the definition to 0 <= x <= m-1 (and counting the same prime twice for x=0 and x=1 if m is prime) would result in an additional term 2. Conjecturally, there would be no more additional terms. - Pontus von Brömssen, Jun 20 2024

			7 is a term since x^2 - x + 7 is prime for x = 1, 3, 4, and 6, which is 4 values of x, and 4 > 7/2.

S. A. Goudsmit, Unusual Prime Number Sequences, Nature Vol. 214 (1967), 1164.
Brady Haran and Matt Parker, Caboose Numbers, Youtube video, June 2024.

Cf. A005846, A007641, A007635, A057604, A188424, A331940, A356756.

Cf. A014556 (Euler's "Lucky" numbers).

q[k_] := Count[Range[k], ?(PrimeQ[#^2 - # + k] &)] > k/2; Select[Range[400], q] (* _Amiram Eldar, Aug 26 2022 *)

isok(m) = sum(k=1, m, isprime(k^2 - k + m)) > m/2; \\ Michel Marcus, Aug 26 2022

from sympy import isprime
def ok(m): return 2*sum(1 for x in range(1, m+1) if isprime(x**2-x+m)) > m
print([m for m in range(1, 400) if ok(m)]) # Michael S. Branicky, Aug 26 2022

A356756 Positive integers m such that x^2 + x + m contains at least m/2 prime numbers for x = 1, 2, ..., m.

Original entry on oeis.org

1, 5, 11, 17, 41, 47, 59, 67, 101, 107, 161, 221, 227, 347, 377

Offset: 1

Marco Ripà, Aug 26 2022

This sequence is related to A188424, since we are considering only the addends m := 2n - 1 of k^2 + k + 2n - 1 such that A188424(n)/(2n - 1) > 1/2.
It is not a subsequence of A356751, nor vice versa, since 1 is a peculiar term, whereas 3 and 7 do not belong to the present sequence, even if they are terms of A356751.
Furthermore, it is conjectured that the present sequence consists of only 15 terms (it has been checked by brute force that there are only 15 terms which are smaller than 20000). Lastly, we trivially point out that all terms must be odd, since if m is even, then x^2 + x + m is also even.
We trivially note that all the terms are odd (since x^2 + x + 2 is not prime for x = 1, nor for x = 2) and a(n - 1) = A356751(n) holds for every n > 3.
For an explanation of the abundance of primes of the form x^2 + x + m, for some given m, see Goudsmit's paper in Links.

			17 is a term since x^2 + x + 17 is prime for x = 1, 2, 3, ..., 15, which is 15 values of x, and 15 >= 17/2.

S. A. Goudsmit, Unusual Prime Number Sequences, Nature Vol. 214 (1967), 1164.

Cf. A005846, A007641, A007635, A057604, A188424, A331940, A356751.

q[k_] := Count[Range[k], ?(PrimeQ[#^2 + # + k] &)] >= k/2; Select[Range[400], q] (* _Amiram Eldar, Aug 26 2022 *)

isok(m) = sum(k=1, m, isprime(k^2 + k + m)) > m/2; \\ Michel Marcus, Aug 26 2022

from sympy import isprime
def ok(m): return 2*sum(1 for x in range(1, m+1) if isprime(x**2+x+m)) >= m
print([m for m in range(1, 400) if ok(m)]) # Michael S. Branicky, Aug 26 2022

cp's OEIS Frontend

A057605 Nonnegative n such that 4*n^2 + 163 is prime.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Extensions

A175233 Numbers n with property that n and 4*n^2 + 163 are terms in A057605.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A356751 Positive integers m such that x^2 - x + m contains more than m/2 prime numbers for x = 1, 2, ..., m.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

A356756 Positive integers m such that x^2 + x + m contains at least m/2 prime numbers for x = 1, 2, ..., m.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python