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 A226611 #8 Jun 15 2013 00:43:46 %S A226611 1,1,3,23,123,171,1,1,3,1,19,99,147,163,123,283,159,319,1,9,1,5,7,1,1, %T A226611 3,1,3,2531,5859,1,1,3,1,3,7,1,1,5,1,9,33,39,21,101,1,1,1,7,9,1,3,149, %U A226611 21,93,125,221,1,175,1,1,1,7,2585,1073,2301,4121,893 %N A226611 Irregular array read by rows. a(n) is the smallest starting value of a T_k trajectory that includes A226607(n), where T_k is the 3x+k function associated with A226607(n). %H A226611 Geoffrey H. Morley, <a href="/A226611/b226611.txt">Rows 1..2032 of array, flattened</a> %e A226611 The irregular array starts: %e A226611 (k=1) 1; %e A226611 (k=5) 1, 3, 23, 123, 171; %e A226611 (k=7) 1; %e A226611 (k=11) 1, 3; %e A226611 a(3)=3 is the smallest starting value for a 3x+5 trajectory that includes A226607(3)=19. The trajectory is {3,7,13,22,11,19,...}. %Y A226611 Row n begins with a(A226612(n)) and has length A226613(n). %Y A226611 The cycle associated with a(n) has length A226609(n) and A226610(n) odd elements of which A226608(n) is the largest. %Y A226611 Cf. A226627. %K A226611 nonn,tabf %O A226611 1,3 %A A226611 _Geoffrey H. Morley_, Jun 13 2013