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.
%I A165330 #8 Apr 14 2020 15:40:13 %S A165330 0,1,371,153,133,371,153,370,371,153,1,371,153,133,371,153,217,371, %T A165330 153,370,371,153,217,371,153,133,371,153,133,371,153,133,371,153,370, %U A165330 371,153,370,371,153,133,371,153,370,371,153,133,407,153,1459,371,153,133 %N A165330 Result of repeatedly replacing a number with the sum of the cubes of its digits until a fixed point or cycle is reached. %C A165330 Range = A046156; %C A165330 A055012(A031179(n)) = A031179(n); %C A165330 A055012(A055012(A165336(n)))=A165336(n) or A055012(A055012(A055012(A165336(n))))=A165336(n); %C A165330 for n>0: a(n) = 153 iff n mod 3 = 0, see A008585; a(A165340(n,k))=153, 0<=k<=n; %C A165330 a(n) = 371 or a(n) = 407 iff n mod 3 = 2, see A016789. %H A165330 R. Zumkeller, <a href="/A165330/b165330.txt">Table of n, a(n) for n = 0..20000</a> %Y A165330 Cf. A031179. %K A165330 base,nonn %O A165330 0,3 %A A165330 _Reinhard Zumkeller_, Sep 17 2009