A055401 -id:A055401 - cp's OEIS frontend

A000433 n written in base where place values are positive cubes.

0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, 21, 22, 23, 24, 25, 26, 27, 30, 31, 32, 100, 101, 102, 103, 104, 105, 106, 107, 110, 111, 112, 113, 114, 115, 116, 117, 120, 121, 122, 123, 124, 125, 126, 127, 130, 131, 132, 200, 201, 202, 203

Offset: 0

R. Muller

Let [d1, d2, d3, ...] be the decimal expansion of the n-th term, then dk is the number of times that the greedy algorithm subtracts the cube k^3 with input n. - Joerg Arndt, Nov 21 2014
For n > 1: A048766(n) = number of digits of a(n); A190311(n) = number of nonzero digits of a(n); A055401(n) = sum of digits of a(n). - Reinhard Zumkeller, May 08 2011
First differs from numbers written in base 8 (A007094) at a(27) = 100, whereas A007094(27) = 33. - Alonso del Arte, Nov 27 2014
The rightmost (least significant) digit never exceeds 7, the second digit from the right never exceeds 3, the third digit never exceeds 2, and the rest are just 0's and 1's. - Ivan Neretin, Sep 03 2015

			a(26) = 32 because 26 = 3 * 2^3 + 2 * 1^3.
a(27) = 100 because 27 = 3^3 + 0 * 2^3 + 0 * 1^3.
a(28) = 101 because 28 = 3^3 + 0 * 2^3 + 1 * 1^3.

Florentin Smarandache, "Properties of the Numbers", University of Craiova Archives, 1975; Arizona State University Special Collections, Tempe, AZ.

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Cf. A000578, A007961.

import Data.Char (intToDigit)
a000433 0 = 0
a000433 n = read $ map intToDigit $
  t n $ reverse $ takeWhile (<= n) $ tail a000578_list where
      t _ []          = []
      t m (x:xs)
          | x > m     = 0 : t m xs
          | otherwise = (fromInteger m') : t r xs where (m',r) = divMod m x
-- Reinhard Zumkeller, May 08 2011

A276615 After a(0)=0, the first differences of A276613.

Original entry on oeis.org

0, 7, 7, 7, 5, 7, 7, 7, 5, 7, 4, 7, 7, 7, 5, 7, 7, 7, 5, 9, 7, 7, 7, 5, 7, 7, 7, 5, 7, 4, 7, 7, 7, 7, 7, 7, 7, 5, 7, 7, 7, 5, 7, 4, 7, 7, 7, 5, 7, 7, 12, 9, 3, 7, 7, 7, 5, 7, 7, 7, 5, 7, 4, 7, 7, 7, 5, 7, 7, 12, 9, 7, 7, 7, 5, 7, 7, 5, 7, 7, 7, 5, 7, 7, 7, 5, 7, 4, 7, 7, 7, 5, 7, 7, 12, 9, 7, 7, 7, 5, 7, 7, 12, 11, 7, 7, 7, 7, 2

Offset: 0

Antti Karttunen, Sep 07 2016

nonn

Antti Karttunen, Table of n, a(n) for n = 0..10236

Cf. A055401, A276613.

a(n) = A055401(A276613(n)).

a(0) = 0; for n >= 1, a(n) = A276613(n) - A276613(n-1).

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

Henry Bottomley, May 16 2000

nonn

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

Rick L. Shepherd, Table of n, a(n) for n = 1..28

Cf. A006892, A055401.

{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

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

More terms from Vladeta Jovovic, Jul 03 2001

cp's OEIS Frontend

A000433 n written in base where place values are positive cubes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

A276615 After a(0)=0, the first differences of A276613.

Views

Author

Keywords

Links

Crossrefs

Formula

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Formula

Extensions