cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

0, 1, 11, 1434, 1269681358
Offset: 0

Views

Author

Seiichi Manyama, Aug 15 2017

Keywords

Examples

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

Crossrefs

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

Programs

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

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

Views

Author

Seiichi Manyama, Oct 14 2019

Keywords

Crossrefs

Programs

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

Formula

a(n) = A328364(n)^5.
Showing 1-2 of 2 results.