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.

A364601 Numbers m such that, if k is the number of digits of m, then for some r > 1, the sum of the k-th powers of the digits of m^r is equal to m.

Original entry on oeis.org

1, 7, 8, 9, 180, 205, 38998, 45994, 89080, 726191, 5540343, 7491889, 8690141, 167535050, 749387107, 9945245922
Offset: 1

Views

Author

René-Louis Clerc, Jul 29 2023

Keywords

Comments

Corresponding r's: any, 4, 3, 2, 6, 2, 2, 2, 2, 2, 3, 2, 3, 3, 4, 3.

Examples

			180 with r=6 satisfies: 180^6 = 34012224000000, 3^3 + 4^3 + 1 + 2^3 + 2^3 + 2^3 + 4^3 = 180.
		

Crossrefs

Cf. A005188 (Armstrong's numbers, case r=1 in our terminology).
Cf. A066003, A066004, A065999 (for terms 7, 8 and 9).

Programs

  • PARI
    SomP(n,p)={resu=0;for(i=1,#digits(n),resu+=(digits(n)[i])^p);resu}
    Ppdi(k,r)={for(n=10^(k-1),10^k,if(SomP(n^r,k)==n,print1(n,";")))}