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!)
 A273877 Least positive integer k such that k^3 + (k+1)^3 + ... + (k+n-2)^3 + (k+n-1)^3 is the sum of two positive cubes. a(n) = 0 if no solution exists. 1

%I

%S 0,1,11,2,10,31,6,70,4,42,4,4,15,174,6,2,70,556,18,378,2,119,4277,6,8,

%T 5,33111,3,2088,61,7,7,145,417,8,13,9,1424,23,18,106,101,7,39,138,276,

%U 13353,48,1,31,645,2981,107627,34,155,11,8,214,62,25,103,28

%N Least positive integer k such that k^3 + (k+1)^3 + ... + (k+n-2)^3 + (k+n-1)^3 is the sum of two positive cubes. a(n) = 0 if no solution exists.

%C What is the most repeated value of this sequence?

%H Chai Wah Wu, <a href="/A273877/b273877.txt">Table of n, a(n) for n = 1..200</a>

%e a(3) = 11 because 11^3 + 12^3 + 13^3 = 7^3 + 17^3.

%Y Cf. A003325, A217843.

%K nonn

%O 1,3

%A _Altug Alkan_, Jun 02 2016

%E a(10)-a(62) from _Giovanni Resta_, Jun 03 2016

%E a(49) corrected by _Chai Wah Wu_, Jun 07 2016

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 August 10 02:28 EDT 2020. Contains 336367 sequences. (Running on oeis4.)