This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055402 Least number represented as the sum of n cubes with greedy algorithm. 1

%I

%S 1,2,3,4,5,6,7,15,23,50,114,330,1330,10591,215970,19464802,

%T 16542386125,409477218238718,1594640520554911022654,

%U 12254971660196485116306102211582,8256321288165573196207266557193504883194549246

%N Least number represented as the sum of n cubes with greedy algorithm.

%H Rick L. Shepherd, <a href="/A055402/b055402.txt">Table of n, a(n) for n = 1..28</a>

%F a(n) = a(n-1) + ceiling(sqrt(a(n-1)/3 + 1/4) - 1/2)^3 for n >= 2.

%e a(11) = 114 = 64 + 27 + 8 + 8 + 1 + 1 + 1 + 1 + 1 + 1 + 1.

%o (PARI)

%o {default(realprecision, 255); v = []; n = 1;

%o while(n < 29,

%o if(n < 8,

%o a = n, a = v[n-1] + ceil(sqrt(v[n-1]/3 + 1/4) - 1/2)^3);

%o v = concat(v, a);

%o write("b055402.txt", n, " ", v[n]); n++)}

%o \\ _Rick L. Shepherd_, Jan 30 2014

%Y Cf. A006892, A055401.

%K nonn

%O 1,2

%A _Henry Bottomley_, May 16 2000

%E More terms from _Vladeta Jovovic_, Jul 03 2001

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.)