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 A226629 #15 Sep 05 2013 07:56:47 %S A226629 3,1,2,1,8,1,1,1,1,3,1,1,2,1,3,1,2,5,35,2,1,2,1,6,9,136,1,1,4,2,1,1, %T A226629 16,3,8,8,1,9,1,2,1,16,7,9,1,1,1,26,21,13,3,4,3,2,2,38,4,2,29,3,1,1,1, %U A226629 1,1,5,1,3,1,1,8,8,1,34,33,3,1,3,1,1,1,96,4 %N A226629 a(n) is the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function, where k=A226630(n). %C A226629 A cycle is called primitive if its elements are not a common multiple of the elements of another cycle. %C A226629 The 3x-k function T_k is defined by T_k(x) = x/2 if x is even, (3x-k)/2 if x is odd, where k is odd. %C A226629 For primitive cycles, GCD(k,6)=1. %H A226629 Geoffrey H. Morley, <a href="/A226629/b226629.txt">Table of n, a(n) for n = 1..600</a> %F A226629 a(n) = A226628(n+1) - A226628(n). %Y A226629 a(n) is the number of terms in the n-th row of A226623 to A226627. %Y A226629 Cf. A226613, A226679. %K A226629 nonn %O A226629 1,1 %A A226629 _Geoffrey H. Morley_, Jun 13 2013