A328374 - 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

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.

%I #10 Oct 15 2019 13:06:07

%S 0,1,229345007,396896379392866465976597929779996699

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

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

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

%Y Cf. A067072, A067074, A291145, A328364.

%K nonn,base,more

%O 0,3

%A _Seiichi Manyama_, Oct 14 2019