This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025302 Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way. 4
 5, 10, 13, 17, 20, 25, 26, 29, 34, 37, 40, 41, 45, 50, 52, 53, 58, 61, 68, 73, 74, 80, 82, 89, 90, 97, 100, 101, 104, 106, 109, 113, 116, 117, 122, 136, 137, 146, 148, 149, 153, 157, 160, 164, 169, 173, 178, 180, 181, 193, 194, 197, 200, 202, 208, 212, 218, 225, 226, 229 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A025441(a(n)) = 1. - Reinhard Zumkeller, Dec 20 2013 LINKS Donovan Johnson, Table of n, a(n) for n = 1..1000 MATHEMATICA nn = 229; t = Table[0, {nn}]; lim = Floor[Sqrt[nn - 1]]; Do[num = i^2 + j^2; If[num <= nn, t[[num]]++], {i, lim}, {j, i - 1}]; Flatten[Position[t, 1]] (* T. D. Noe, Apr 07 2011 *) a[1] = 5; a[ n_] := a[n] = Module[ {s = a[n - 1], t = True, j}, While[ t, s++; Do[ If[ i^2 + (j = Floor[Sqrt[s - i^2]])^2 == s && i < j, t = False; Break], {i, Sqrt[s/2]}]]; s]; (* Michael Somos, Jan 20 2019 *) PROG (Haskell) a025302 n = a025302_list !! (n-1) a025302_list = [x | x <- [1..], a025441 x == 1] CROSSREFS Cf. A009000, A009003, A024507, A004431. Cf. Subsequence of A001983; A004435. Sequence in context: A230486 A024507 A004431 * A268379 A221265 A055096 Adjacent sequences:  A025299 A025300 A025301 * A025303 A025304 A025305 KEYWORD nonn AUTHOR 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 21 22:47 EDT 2019. Contains 328315 sequences. (Running on oeis4.)