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!)
 A050804 Numbers n such that n^3 is the sum of two nonzero squares in exactly one way. 4
 2, 8, 18, 32, 72, 98, 128, 162, 242, 288, 392, 512, 648, 722, 882, 968, 1058, 1152, 1458, 1568, 1922, 2048, 2178, 2592, 2888, 3528, 3698, 3872, 4232, 4418, 4608, 4802, 5832, 6272, 6498, 6962, 7688, 7938, 8192 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS m is a term if and only if m = 2^(2a_0+1)*p_1^(2a_1)*p_2^(2a_2)*...*p_k^(2a_k), where a_i are nonnegative integers and p_i are primes of the form 4k+3. - Chai Wah Wu, Feb 27 2016 m is a term if and only if for all odd q > 1, m^q is the sum of two nonzero squares in exactly one way. - Chai Wah Wu, Feb 28 2016 Numbers n such that n is the sum of two nonzero squares while n^2 is not. - Altug Alkan, Apr 11 2016 LINKS Chai Wah Wu, Table of n, a(n) for n = 1..10000 FORMULA n such that A084888(n) = 1. EXAMPLE E.g. 32^3 = 128^2 + 128^2. Is there an example using different squares? No: If n^3 has only one representation as n^3 = a^2+b^2 with 0

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 September 19 06:21 EDT 2021. Contains 347551 sequences. (Running on oeis4.)