A286650 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A286650

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

3

0, 1, 11, 1434, 1269681358

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Table of n, a(n) for n=0..4.

EXAMPLE

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

PROG

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

CROSSREFS

Cf. A061912, A067075, A069648, A291145.

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

Sequence in context: A015484 A145185 A068896 * A377640 A015027 A160264

Adjacent sequences: A286647 A286648 A286649 * A286651 A286652 A286653

KEYWORD

nonn,base,more

AUTHOR

Seiichi Manyama, Aug 15 2017

STATUS

approved