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.

A059844 a(n) = smallest nonzero square x^2 such that n+x^2 is prime.

Original entry on oeis.org

1, 1, 4, 1, 36, 1, 4, 9, 4, 1, 36, 1, 4, 9, 4, 1, 36, 1, 4, 9, 16, 1, 36, 49, 4, 81, 4, 1, 144, 1, 16, 9, 4, 9, 36, 1, 4, 9, 4, 1, 576, 1, 4, 9, 16, 1, 36, 25, 4, 9, 16, 1, 36, 25, 4, 81, 4, 1, 324, 1, 36, 9, 4, 9, 36, 1, 4, 81, 4, 1, 36, 1, 16, 9, 4, 25, 36, 1, 4, 9, 16, 1, 144, 25, 4, 81
Offset: 1

Views

Author

Labos Elemer, Feb 26 2001

Keywords

Comments

a(n) = 1 for n in A006093. - Robert Israel, Dec 31 2023

Examples

			a(24) = 49 because 49 + 24 = 73 is prime and 1 + 24 = 25, 4 + 24 = 28, 9 + 24 = 33, 16 + 24 = 40, 25 + 24 = 49, and 36 + 24 = 60 are composite.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local x;
     for x from 1 + (n mod 2) by 2  do
      if isprime(n+x^2) then return x^2 fi;
     od
    end proc:
    f(1):= 1:
    map(f, [$1..100]); # Robert Israel, Dec 31 2023
  • Mathematica
    sqs[n_]:=Module[{q=1},While[!PrimeQ[n+q],q=(Sqrt[q]+1)^2];q]; Array[ sqs,90] (* Harvey P. Dale, Aug 11 2017 *)

Formula

a(n) + n is the smallest prime of the form x^2 + n.