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.

A046253 Equal to the sum of its nonzero digits raised to its own power.

Original entry on oeis.org

0, 1, 3435, 438579088
Offset: 1

Views

Author

Patrick De Geest, May 15 1998

Keywords

Comments

A variant of Münchausen numbers, cf. A166623.
The sequence is finite, because the sum can't exceed 9^9*L < 10^9*L, where L is the number of digits, and for L > 10 this is less than the number N >= 10^(L-1). - M. F. Hasler, Oct 01 2024

Examples

			3435 = 3^3 + 4^4 + 3^3 + 5^5.
		

References

  • J. S. Madachy, "Madachy's Mathematical Recreations", Dover N.Y., pp. 163-175.
  • C. A. Pickover, "Keys to Infinity", Wiley 1995, Ch. 22, pp. 169-171.
  • Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, page 37.
  • David Wells, "Curious and Interesting Numbers", Penguin 1988, pp. 169, 190.

Crossrefs

Fixed points of A045512. See also A045503 (includes zero digits).

Programs

  • C
    see Bailey and Hutchens links
    
  • Mathematica
    Select[Range[0,10000],Total[#^#&/@DeleteCases[IntegerDigits@#,0]]==#&]  (* Giorgos Kalogeropoulos, May 08 2019 *)
  • PARI
    select( {is_A046253(n)=n==A045512(n)}, [0..10^4]) \\ To find the 4th solution, multiply the set by 51817. - M. F. Hasler, Oct 01 2024