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.

A143788 Prime numbers p such that p + q = 117810 with q prime and p*q=58905^2-x^2.

Original entry on oeis.org

13, 23, 31, 37, 47, 53, 59, 79, 83, 89, 101, 107, 109, 131, 137, 139, 151, 167, 191, 193, 233, 239, 269, 271, 281, 293, 307, 311, 313, 367, 373, 379, 383, 397, 421, 439, 449, 457, 479, 491, 503, 541, 569, 571, 587, 601, 607, 617, 619, 643, 647, 677, 683, 691
Offset: 1

Views

Author

Pierre CAMI, Sep 01 2008

Keywords

Comments

The sequence has 2613 terms.

Crossrefs

Programs

  • Mathematica
    okQ[n_]:=Module[{q=117810-n},PrimeQ[q]&&IntegerQ[Sqrt[3469799025- n*q]]]; Select[Prime[Range[200]],okQ] (* Harvey P. Dale, Jul 18 2011 *)
  • Other
    n = 58905, a(i) = odd primes k = 0: i = 0: j = 11300 10 k = k + 1 If k > (n - 3) / 2 Then End p = 2 * k + 1: q = 2 * (n - k - 1) + 1 15 i = i + 1 If p < a(i) Then i = i - 1: GoTo 10 If p = a(i) Then GoTo 20 GoTo 15 20 j = j - 1 If q > a(j) Then j = j + 1: GoTo 10 If q = a(j) Then Print p: GoTo 10 GoTo 20 GoTo 10