login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068487 Smallest prime equal to n^2 + m^2 with n<m. 3

%I #13 Aug 03 2014 14:01:18

%S 5,13,73,41,61,157,113,233,181,269,317,313,569,421,709,617,613,853,

%T 761,929,1117,1013,1429,1201,1301,1637,1753,1873,1741,1861,2897,2113,

%U 2689,2381,2521,3697,2969,3469,3121,3449,3617,3613,4153,4337,4729,4517,4513

%N Smallest prime equal to n^2 + m^2 with n<m.

%C All terms are congruent to 1 (mod 4). - Carmine Suriano, Mar 30 2011

%H Carmine Suriano, <a href="/A068487/b068487.txt">Table of n, a(n) for n = 1..872</a>

%p for n from 1 to 100 do m := n+1:while(not isprime(n^2+m^2)) do m := m+1; end do:a[n] := n^2+m^2:end do:q := seq(a[i],i=1..100);

%t Table[k = n + 1; While[p = n^2 + k^2; ! PrimeQ[p], k++]; p, {n, 100}] (* _T. D. Noe_, Mar 30 2011 *)

%Y Cf. A089489 (values of m).

%K nonn

%O 1,1

%A _Lekraj Beedassy_, Mar 11 2002

%E More terms from _Sascha Kurz_, Mar 17 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 05:00 EDT 2024. Contains 372020 sequences. (Running on oeis4.)