A067074 -id:A067074 - cp's OEIS frontend

A067075 a(n) is the smallest number m such that the sum of the digits of m^3 is equal to n^3.

0, 1, 2, 27, 1192, 341075, 3848163483, 2064403725539899

Offset: 0

Amarnath Murthy, Jan 05 2002

If n = 6*k, a(n) <= A002283(n^3/18). For example, a(6) = 3848163483 <= A002283(6^3/18) = 999999999999. - Seiichi Manyama, Aug 12 2017
a(n) >= ceiling(A051885(n^3)^(1/3)). For example a(7) >= ceiling(A051885(7^3)^(1/3)) = ceiling((2*10^38-1)^(1/3)) = 5848035476426 - David A. Corneth, Aug 23 2018
From Zhining Yang, Jun 20 2024: (Start)
a(8) <= 99995999799995999999999.
a(9) <= 999699989999999949999999999999999.
a(10) <= 199999999929999999999949999999999999999999999.
(End)

			a(3) = 27 as 27^3 = 19683 is the smallest cube whose digit sum = 27 = 3^3.

Cf. A051885, A061912, A067074. Subsequence of A067177.

Do[k = 1; While[Plus @@ IntegerDigits[k^3] != n^3, k++ ]; Print[k], {n, 1, 6}] (* Ryan Propper, Jul 07 2005 *)

a(n) = my(k=0); while (sumdigits(k^3) != n^3, k++); k; \\ Seiichi Manyama, Aug 12 2017

Corrected and extended by Ryan Propper, Jul 07 2005
a(0)=0 prepended by Seiichi Manyama, Aug 12 2017
a(7) from Zhining Yang, Jun 20 2024

A067072 a(n) = smallest square m^2 such that the sum of the digits of m^2 is equal to n^2.

Original entry on oeis.org

0, 1, 4, 9, 169, 4489, 69696, 2778889, 277788889, 8998988769, 2699997789889, 898999897988929, 498999778899898896, 969988797999759789889, 1679898987989978888999689

Offset: 0

Amarnath Murthy, Jan 05 2002

			a(5) = 4489 = 67^2 as it is the smallest square whose digit sum = 25 = 5^2.

Cf. A061912, A067074.

a(n) = A061912(n)^2.

More terms from Jason Earls, Jan 09 2002
a(11)-a(14) from Donovan Johnson, Jul 10 2012
a(0)=0 prepended by Seiichi Manyama, Aug 12 2017

A291145 a(n) is the smallest fourth power m^4 such that the sum of the digits of m^4 is equal to n^4.

Original entry on oeis.org

0, 1, 14641, 4228599998736, 2598836588984899974898904499869498896

Offset: 0

Seiichi Manyama, Aug 18 2017

Cf. A067072, A067074, A286650.

a(n) = A286650(n)^4.

A328374 a(n) is the smallest fifth power m^5 such that the sum of the digits of m^5 is equal to n^5.

Original entry on oeis.org

0, 1, 229345007, 396896379392866465976597929779996699

Offset: 0

Seiichi Manyama, Oct 14 2019

Cf. A067072, A067074, A291145, A328364.

{a(n) = my(k=0); while(sumdigits(k^5) != n^5, k++); k^5}

a(n) = A328364(n)^5.

cp's OEIS Frontend

A067075 a(n) is the smallest number m such that the sum of the digits of m^3 is equal to n^3.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Extensions

A067072 a(n) = smallest square m^2 such that the sum of the digits of m^2 is equal to n^2.

Views

Author

Keywords

Examples

Crossrefs

Formula

Extensions

A291145 a(n) is the smallest fourth power m^4 such that the sum of the digits of m^4 is equal to n^4.

Views

Author

Keywords

Crossrefs

Formula

A328374 a(n) is the smallest fifth power m^5 such that the sum of the digits of m^5 is equal to n^5.

Views

Author

Keywords

Crossrefs

Programs

PARI

Formula