The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328151 a(n) is the smallest nonnegative integer k where exactly n ordered pairs of positive integers (x, y) exist such that x^2 + y^2 = k. 0
 0, 2, 5, 50, 65, 1250, 325, 31250, 1105, 8450, 8125, 19531250, 5525, 488281250, 105625, 211250, 27625, 305175781250, 71825, 7629394531250, 138125, 5281250, 126953125 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is the smallest nonnegative i such that A063725(i) = n. LINKS EXAMPLE For n = 3: The sums of the two members of each of the pairs (1, 49), (25, 25) and (49, 1) is 50 and 50 is the smallest nonnegative integer where exactly 3 such pairs exist, so a(3) = 50. PROG (PARI) a063725(n) = if(n==0, return(0)); my(f=factor(n)); prod(i=1, #f~, if(f[i, 1]%4==1, f[i, 2]+1, f[i, 2]%2==0 || f[i, 1]==2)) - issquare(n) \\ after Charles R Greathouse IV in A063725 a(n) = for(x=0, oo, if(a063725(x)==n, return(x))) CROSSREFS Cf. A063725. Sequence in context: A099658 A244014 A102011 * A208797 A004098 A208206 Adjacent sequences:  A328148 A328149 A328150 * A328152 A328153 A328154 KEYWORD nonn,hard,more AUTHOR Felix Fröhlich, Oct 05 2019 EXTENSIONS a(13)-a(22) from Bert Dobbelaere, Oct 20 2019 STATUS approved

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

Last modified October 22 07:06 EDT 2021. Contains 348160 sequences. (Running on oeis4.)