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!)
A212285 Least k > 0 such that nk = x^3 + y^3 for nonnegative x and y. 2

%I #12 May 13 2013 01:54:21

%S 1,1,3,2,7,9,4,1,1,25,31,6,5,2,57,1,73,3,7,14,6,121,133,3,5,18,1,1,

%T 211,225,7,2,273,289,1,2,10,4,9,7,421,3,8,62,19,529,553,9,7,5,651,9,

%U 703,1,757,4,9,841,871,114,13,27,2,1,1,1089,11,146,1191,4,1261

%N Least k > 0 such that nk = x^3 + y^3 for nonnegative x and y.

%C Broughan calls this theta(n) and proves that it exists for all n.

%H Charles R Greathouse IV, <a href="/A212285/b212285.txt">Table of n, a(n) for n = 1..1000</a>

%H Kevin A. Broughan, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Broughan/broughan25.html">Characterizing the Sum of Two Cubes</a>, J. Integer Seqs., Vol. 6, 2003.

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>

%F a(n) <= A212286(n) <= 2n^2 + 6, a(a(n)) <= n.

%e 3 is not the sum of two nonnegative cubes, nor is 6. But 9 = 2^3 + 1^3 and so a(3) = 9/3 = 3.

%o (PARI) sumOfTwoCubes(n)=my(k1=ceil((n-1/2)^(1/3)), k2=floor((4*n+1/2)^(1/3)), L); fordiv(n,d,if(d>=k1 && d<=k2 && denominator(L=(d^2-n/d)/3)==1 && issquare(d^2-4*L), return(1))); 0

%o a(n)=forstep(k=n,2*n*(n^2+3),n,if(sumOfTwoCubes(k),return(k/n)))

%Y Cf. A004999, A212286.

%K nonn

%O 1,3

%A _Charles R Greathouse IV_, Jun 12 2012

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)