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 A096293 #3 Dec 15 2017 17:36:43 %S A096293 0,0,8,76,72,0,330,8,73,77,76,7,75,73,72,66,6,62,25,75,67,72,74,74,8, %T A096293 66,38,70,74,71,72,62,72,70,61,73,7,75,70,330,71,0,329,73,61,62,73,71, %U A096293 72,74,71,73,65,7,74,329,73,70,69,70,62,0,3,39,60,65,5,328,60,72,75,7,73 %N A096293 Number of iterations of n -> n + (sum of squares of digits of n) needed for the trajectory of n to join the trajectory of A033936. %C A096293 Conjecture: For any positive integer starting value n, iterations of n -> n + (sum of squares of digits of n) will eventually join A033936 (verified for all n up to 20000). %e A096293 a(3)=8 because the trajectory for 1 (sequence A033936) starts %e A096293 1->2->6->42->62->102->107->157->232->249->350->384->473... %e A096293 and the trajectory for 3 starts %e A096293 3->12->17->67->152->182->251->281->350->384->473... %e A096293 so the sequence beginning with 3 joins A033936 after 8 steps. %K A096293 base,nonn %O A096293 1,3 %A A096293 _Jason Earls_, Jun 24 2004