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.

A267252 Primes of the form abs(103*n^2 - 4707*n + 50383) in order of increasing nonnegative n.

Original entry on oeis.org

50383, 45779, 41381, 37189, 33203, 29423, 25849, 22481, 19319, 16363, 13613, 11069, 8731, 6599, 4673, 2953, 1439, 131, 971, 1867, 2557, 3041, 3319, 3391, 3257, 2917, 2371, 1619, 661, 503, 1873, 3449, 5231, 7219, 9413, 11813, 14419, 17231, 20249, 23473, 26903
Offset: 1

Views

Author

Robert Price, Apr 28 2016

Keywords

Comments

This polynomial is a transformed version of the polynomial P(x) = 103*x^2 + 31*x - 3391 whose absolute value gives 43 distinct primes for -23 <= x <= 19, found by G. W. Fung in 1988. - Hugo Pfoertner, Dec 13 2019

Examples

			33203 is in this sequence since 103*4^2 - 4707*4 + 50383  = 1648-18828+50383 = 33203 is prime.
		

References

  • Paulo Ribenboim, The Little Book of Bigger Primes, Second Edition, Springer-Verlag New York, 2004.

Crossrefs

Programs

  • Mathematica
    n = Range[0, 100]; Abs @ Select[103n^2 - 4707n + 50383 , PrimeQ[#] &]
  • PARI
    lista(nn) = for(n=0, nn, if(isprime(p=abs(103*n^2-4707*n+50383)), print1(p, ", "))); \\ Altug Alkan, Apr 28 2016, corrected by Hugo Pfoertner, Dec 13 2019

Extensions

Title corrected by Hugo Pfoertner, Dec 13 2019