login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046197 Fixed points for operation of repeatedly replacing a number with the sum of the cubes of its digits. 26
0, 1, 153, 370, 371, 407 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
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
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.
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.
LINKS
H. Lehning, La migration des nombres vers le bonheur, Tangente: L'aventure mathématique, pp. 27 No. 108 Jan-Feb 2006 Pole Paris.
FORMULA
A055012(a(n))=a(n); A165331(a(n))=0; subset of A031179. - Reinhard Zumkeller, Sep 17 2009
EXAMPLE
1^3 + 5^3 + 3^3 = 153. 3^3+7^3 +0^3 = 370.
PROG
(PARI) for(n=0, 10^5, A055012(n)==n&&print1(n", ")) \\ M. F. Hasler, Apr 12 2015
CROSSREFS
Sequence in context: A332228 A349755 A066528 * A271730 A056733 A256748
KEYWORD
nonn,fini,full,base
AUTHOR
Richard C. Schroeppel
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 02:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)