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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025399 Numbers that are the sum of 3 distinct positive cubes in exactly 1 way. 5

%I #16 Jun 15 2018 06:02:56

%S 36,73,92,99,134,153,160,190,197,216,225,244,251,281,288,307,342,349,

%T 352,368,371,378,405,408,415,434,469,476,495,521,532,540,547,560,567,

%U 577,584,586,603,623,638,645,664,684,701,729,736,738,755,757,764,792,794,801,820

%N Numbers that are the sum of 3 distinct positive cubes in exactly 1 way.

%H Chai Wah Wu, <a href="/A025399/b025399.txt">Table of n, a(n) for n = 1..10000</a>

%F A024975 MINUS A024974. - _R. J. Mathar_, May 28 2008

%F {n: A025469(n) = 1}. - _R. J. Mathar_, Jun 15 2018

%t Reap[For[n = 1, n <= 1000, n++, pr = Select[ PowersRepresentations[n, 3, 3], Times @@ # != 0 && Length[#] == Length[Union[#]] &]; If[pr != {} && Length[pr] == 1, Print[n, pr]; Sow[n]]]][[2, 1]] (* _Jean-François Alcover_, Jul 31 2013 *)

%Y Cf. A025395 (not necessarily distinct)

%K nonn

%O 1,1

%A _David W. Wilson_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)