The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A165330 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A165330

Result of repeatedly replacing a number with the sum of the cubes of its digits until a fixed point or cycle is reached.
(history; published version)

#8 by Alois P. Heinz at Tue Apr 14 15:40:13 EDT 2020

STATUS

editing

approved

#7 by Alois P. Heinz at Tue Apr 14 15:40:10 EDT 2020

COMMENTS

A055012(A165332A031179(n)) = A165332A031179(n);

CROSSREFS

Cf. A031179.

STATUS

approved

editing

#6 by Jon E. Schoenfield at Fri Mar 31 20:41:44 EDT 2017

STATUS

proposed

approved

#5 by Jon E. Schoenfield at Fri Mar 31 20:41:34 EDT 2017

STATUS

editing

proposed

#4 by Jon E. Schoenfield at Fri Mar 31 20:41:17 EDT 2017

NAME

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

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:51:04 EDT 2012

AUTHOR

_Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Sep 17 2009

Discussion

Fri Mar 30

18:51

OEIS Server: https://oeis.org/edit/global/246

#2 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010

LINKS

R. Zumkeller, <a href="/A165330/b165330.txt">Table of n, a(n) for n = 0..20000</a>

KEYWORD

base,nonn,new

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

NAME

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

DATA

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,3

COMMENTS

Range = A046156;

A055012(A165332(n)) = A165332(n);

A055012(A055012(A165336(n)))=A165336(n) or A055012(A055012(A055012(A165336(n))))=A165336(n);

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.

LINKS

R. Zumkeller, <a href="b165330.txt">Table of n, a(n) for n = 0..20000</a>

KEYWORD

base,nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 17 2009

STATUS

approved