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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094714 Smallest prime having exactly n representations as a^2+b^2+c^2 with c >= b >= a > 0. 2
 2, 3, 41, 89, 251, 269, 593, 461, 521, 929, 761, 941, 1109, 1481, 1601, 1361, 2309, 1949, 1889, 2141, 2729, 2609, 3701, 3461, 3989, 3449, 5309, 4241, 4289, 5081, 7589, 5381, 9521, 6569, 8861, 7229, 7829, 8501, 8069, 13781, 8609, 12689, 10601, 11261, 14741 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Donovan Johnson, Table of n, a(n) for n = 0..5000 EXAMPLE a(2) = 41 because 41 = 1+4+36 = 9+16+16. a(2^10) = a(1024) = 3521909 = prime(251585). - Zak Seidov, Nov 10 2013 MATHEMATICA lim=50; pLst=Table[0, {PrimePi[lim^2]}]; Do[n=a^2+b^2+c^2; If[n= b >= c > 0). Sequence in context: A215389 A215154 A215101 * A200817 A042475 A241277 Adjacent sequences: A094711 A094712 A094713 * A094715 A094716 A094717 KEYWORD nonn AUTHOR T. D. Noe, May 21 2004 STATUS approved

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.

Last modified January 31 01:17 EST 2023. Contains 359947 sequences. (Running on oeis4.)