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.

A046197 Fixed points for operation of repeatedly replacing a number with the sum of the cubes of its digits.

Original entry on oeis.org

0, 1, 153, 370, 371, 407
Offset: 1

Views

Author

Richard C. Schroeppel

Keywords

Comments

Suppose n has d digits; then the sum of the cubes of its digits is <= 729d and n >= 10^(d-1). So d <= 5. It is now easy to check that the numbers shown are the only solutions. [Corrected by M. F. Hasler, Apr 12 2015]
This is row n=3 of A252648. - M. F. Hasler, Apr 12 2015

Examples

			1^3 + 5^3 + 3^3 = 153. 3^3+7^3 +0^3 = 370.
		

References

  • J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 153, p. 50, Ellipses, Paris 2008.
  • G. H. Hardy, A Mathematician's Apology, Cambridge, 1967.
  • Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 60-62.
  • J. Shallit, Number theory and formal languages, in Emerging applications of number theory (Minneapolis, MN, 1996), 547-570, IMA Vol. Math. Appl., 109, Springer, New York, 1999.
  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 140.

Crossrefs

Programs

  • Mathematica
    Select[Range[0,407],Total[IntegerDigits[#]^3]==# &] (* Stefano Spezia, Sep 08 2024 *)
  • PARI
    for(n=0,10^5,A055012(n)==n&&print1(n",")) \\ M. F. Hasler, Apr 12 2015

Formula

A055012(a(n))=a(n); A165331(a(n))=0; subset of A031179. - Reinhard Zumkeller, Sep 17 2009