A069648 -id:A069648 - cp's OEIS frontend

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

0, 1, 11, 1434, 1269681358

Offset: 0

Seiichi Manyama, Aug 15 2017

			a(2) = 11 as 11^4 = 14641 is the smallest fourth power whose digit sum = 16 = 2^4.

Cf. A061912, A067075, A069648, A291145.

Cf. A000583 (n^4), A055565 (sum of digits of n^4).

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

A069647 a(1) = 1; for n > 1, the smallest n-th power with the digit sum also a nontrivial n-th power, i.e., 10^n is not a member.

Original entry on oeis.org

1, 4, 8, 14641, 229345007, 9474296896, 886899938586555644327, 1968149944695589999318735995870695144816896, 29733387998758905886191953999849859976998299361889769463896694547608377966796875

Offset: 1

Amarnath Murthy, Apr 04 2002

Are there members with digit sum other than 2^n?

			a(4) = 14641 because 14641 is 11^4 and its digit sum is 16, which is 2^4.

Cf. A069648.

Corrected and extended by David Wasserman, Apr 23 2003

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

Original entry on oeis.org

0, 1, 47, 13174539

Offset: 0

Seiichi Manyama, Oct 14 2019

			a(2) = 47 as 47^5 = 229345007 is the smallest fifth power whose digit sum = 32 = 2^5.

Cf. A061912, A069648, A067075, A286650, A328374.

Cf. A000584 (n^5), A055566 (sum of digits of n^5).

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

cp's OEIS Frontend

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

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

A069647 a(1) = 1; for n > 1, the smallest n-th power with the digit sum also a nontrivial n-th power, i.e., 10^n is not a member.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI