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 A226627 #15 Sep 05 2013 07:56:43 %S A226627 1,5,17,19,33,73,51,2263,2359,2451,1671,2463,1719,2367,4819,89,85,63, %T A226627 65,685,397,1165,293,507,369,449,769,147,227,251,247,1085,777,7471, %U A226627 7299,11811,5379,8115,267,1355,1367,1043,587,779,2123,827,2219,843,1611,1707 %N A226627 Irregular array read by rows. a(n) is the smallest starting value of a T_k trajectory that includes A226623(n), where T_k is the Collatz-like 3x-k function associated with A226623(n). %H A226627 Geoffrey H. Morley, <a href="/A226627/b226627.txt">Rows 1..280 of array, flattened</a> %e A226627 The irregular array starts: %e A226627 (k=1) 1, 5, 17; %e A226627 (k=11) 19; %e A226627 (k=17) 33, 73; %e A226627 (k=19) 51; %e A226627 a(5)=33 is the smallest starting value for a 3x-17 trajectory that includes A226623(5)=65. The trajectory is {33,41,53,71,98,49,65,...}. %Y A226627 Row n begins with a(A226628(n)) and has length A226629(n). k=A226630(n). %Y A226627 The cycle associated with a(n) has length A226625(n) and A226626(n) odd elements of which A226624(n) is the largest. %Y A226627 Cf. A226611. %K A226627 nonn,tabf %O A226627 1,2 %A A226627 _Geoffrey H. Morley_, Jun 13 2013