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.

A165330 Result of repeatedly replacing a number with the sum of the cubes of its digits until a fixed point or cycle is reached.

Original entry on oeis.org

0, 1, 371, 153, 133, 371, 153, 370, 371, 153, 1, 371, 153, 133, 371, 153, 217, 371, 153, 370, 371, 153, 217, 371, 153, 133, 371, 153, 133, 371, 153, 133, 371, 153, 370, 371, 153, 370, 371, 153, 133, 371, 153, 370, 371, 153, 133, 407, 153, 1459, 371, 153, 133
Offset: 0

Views

Author

Reinhard Zumkeller, Sep 17 2009

Keywords

Comments

Range = A046156;
for n>0: a(n) = 153 iff n mod 3 = 0, see A008585; a(A165340(n,k))=153, 0<=k<=n;
a(n) = 371 or a(n) = 407 iff n mod 3 = 2, see A016789.

Crossrefs

Cf. A031179.