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.

Showing 1-2 of 2 results.

A268101 Smallest prime p such that some polynomial of the form a*x^2 - b*x + p generates distinct primes in absolute value for x = 1 to n, where 0 < a < p and 0 <= b < p.

Original entry on oeis.org

2, 3, 5, 5, 7, 7, 11, 11, 11, 11, 13, 13, 17, 17, 17, 17, 19, 19, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 647, 1277, 1979, 2753
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jan 26 2016

Keywords

Examples

			a(1) = 2 (a prime), x^2 + 2 gives a prime for x = 1.
a(2) = 3 (a prime), 2*x^2 + 3 gives distinct primes for x = 1 to 2.
a(4) = 5 (a prime), 2*x^2 + 5 gives distinct primes for x = 1 to 4.
a(6) = 7 (a prime), 4*x^2 + 7 gives distinct primes for x = 1 to 6.
a(10) = 11 (a prime), 2*x^2 + 11 gives distinct primes for x = 1 to 10.
a(12) = 13 (a prime), 6*x^2 + 13 gives distinct primes for x = 1 to 12.
a(16) = 17 (a prime), 6*x^2 + 17 gives distinct primes for x = 1 to 16.
a(18) = 19 (a prime), 10*x^2 + 19 gives distinct primes for x = 1 to 18.
a(22) = 23 (a prime), 3*x^2 - 3*x + 23 gives distinct primes for x = 1 to 22.
a(28) = 29 (a prime), 2*x^2 + 29 gives distinct primes for x = 1 to 28.
a(29) = 31 (a prime), 2*x^2 - 4*x + 31 gives distinct primes for x = 1 to 29.
a(40) = 41 (a prime), x^2 - x + 41 gives distinct primes for x = 1 to 40.
a(41) = 647 (a prime), abs(36*x^2 - 594*x + 647) gives distinct primes for x = 1 to 41.
a(42) = 1277 (a prime), abs(36*x^2 - 666*x + 1277) gives distinct primes for x = 1 to 42.
a(43) = 1979 (a prime), abs(36*x^2 - 738*x + 1979) gives distinct primes for x = 1 to 43.
a(44) = 2753 (a prime), abs(36*x^2 - 810*x + 2753) gives distinct primes for x = 1 to 44.
		

Crossrefs

A289839 Primes of the form 8*n^2+8*n+31.

Original entry on oeis.org

31, 47, 79, 127, 191, 271, 367, 479, 607, 751, 911, 1087, 1279, 1487, 1951, 2207, 2767, 3391, 3727, 4079, 4447, 4831, 5231, 5647, 6079, 6991, 9007, 9551, 10111, 10687, 11279, 11887, 12511, 13151, 13807, 14479, 17327, 20431, 21247, 22079, 24671, 26479, 27407
Offset: 1

Views

Author

Waldemar Puszkarz, Oct 06 2017

Keywords

Comments

The first 14 terms correspond to n from 0 to 13, which makes 8*n^2+8*n+31 a prime-generating polynomial (see the link).
This is a prime-generating polynomial of the form c*n^2+c*n+p, where c=2^k (k=0,1,2...) and p is prime with c and p containing at most two digits. Prime-generating polynomials of this kind arise for k=0,1,2,3 - see A005846 and A007635 (k=0), A007639 (k=1), and A048988 (k=2).
All terms are of the form 4m+3. Terms 1 and 4 are Mersenne primes (A000668).

Examples

			79 is a term as it is a prime corresponding to n=2: 8*4+8*2+31=79.
		

Crossrefs

Cf. A000040 (primes), A005846, A007635, A007639, A048988, A281437, A292578 (similar prime-generating sequences).

Programs

  • Mathematica
    Select[Range[0,100]//8#^2+8#+31&, PrimeQ]
  • PARI
    for(n=0, 100, isprime(p=8*n^2+8*n+31)&& print1(p ", "))
Showing 1-2 of 2 results.