login
This site is supported by donations to The OEIS Foundation.
Logo

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. 1
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 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

EXAMPLE

a(2) = 41 because 41 = 1+4+36 = 9+16+16.

MATHEMATICA

lim=50; pLst=Table[0, {PrimePi[lim^2]}]; Do[n=a^2+b^2+c^2; If[n<lim^2 && PrimeQ[n], pLst[[PrimePi[n]]]++ ], {a, lim}, {b, a, Sqrt[lim^2-a^2]}, {c, b, Sqrt[lim^2-a^2-b^2]}; Table[First[Prime[Flatten[Position[pLst, n]]]], {n, 0, 38}]

CROSSREFS

Cf. A094713 (number of ways that prime(n) can be represented as a^2+b^2+c^2 with a >= b >= c > 0).

Sequence in context: A077336 A013646 A059800 * A042475 A123993 A101821

Adjacent sequences:  A094711 A094712 A094713 * A094715 A094716 A094717

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), May 21 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:53 EST 2012. Contains 205570 sequences.