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 A226625 #13 Sep 05 2013 07:56:33 %S A226625 1,3,11,4,6,6,17,19,19,19,19,19,19,19,19,34,12,9,5,22,22,22,12,17,17, %T A226625 17,69,7,7,7,18,44,22,38,38,38,38,38,22,22,33,33,22,11,11,22,11,11,11, %U A226625 11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,48,12 %N A226625 Irregular array read by rows. a(n) is the length of the primitive Collatz-like 3x-k cycle associated with A226623(n). %C A226625 Conjecture: Every cycle with the same value of k (k>1) has the same proportion of odd and even elements. Thus if n>1 then A226626(n)/A226625(n) has the same value for each m where A226628(n) <= m < A226628(n+1). %H A226625 Geoffrey H. Morley, <a href="/A226625/b226625.txt">Rows 1..280 of array, flattened</a> %e A226625 The irregular array starts: %e A226625 (k=1) 1, 3, 11; %e A226625 (k=11) 4; %e A226625 (k=17) 6, 6; %e A226625 (k=19) 17; %e A226625 a(4)=4 is the length of the 3x-11 cycle {19,23,29,38} associated with A226623(4)=19. %Y A226625 Row n begins with a(A226628(n)) and has length A226629(n). k=A226630(n) %Y A226625 The cycle associated with a(n) has A226626(n) odd elements of which A226624(n) is the largest. %Y A226625 Cf. A226609, A226627, A226631, A226686, A226687, A226688. %K A226625 nonn,tabf %O A226625 1,2 %A A226625 _Geoffrey H. Morley_, Jun 13 2013