cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 15, 23, 50, 114, 330, 1330, 10591, 215970, 19464802, 16542386125, 409477218238718, 1594640520554911022654, 12254971660196485116306102211582, 8256321288165573196207266557193504883194549246
Offset: 1

Views

Author

Henry Bottomley, May 16 2000

Keywords

Examples

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

Crossrefs

Programs

  • PARI
    {default(realprecision, 255); v = []; n = 1;
    while(n < 29,
      if(n < 8,
        a = n, a = v[n-1] + ceil(sqrt(v[n-1]/3 + 1/4) - 1/2)^3);
      v = concat(v, a);
      write("b055402.txt", n, " ", v[n]); n++)}
    \\ Rick L. Shepherd, Jan 30 2014

Formula

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

Extensions

More terms from Vladeta Jovovic, Jul 03 2001