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 A096010 #5 May 10 2013 12:45:34 %S A096010 2,2,3,3,5,7,11,17,31,53,95,173,317,587,1097,2049,3857,7287,13799, %T A096010 26217 %N A096010 Number of different cycles computed with the generalized 3x+1 problem using C=2, B=Cn+m, A=C^m. %H A096010 J. C. Lagarias, <a href="http://www.cecm.sfu.ca/organics/papers/lagarias/paper/html/paper.html">The 3x+1 problem and its generalizations</a>, Amer. Math. Monthly, 92 (1985), 3-23. %F A096010 Generalize the 3x+1-Problem from S:= S / 2 if S is even, S:= (S * 3) + 1 if S is odd to S:= S / C if C | S S:= (S * B) + A otherwise. For B=Cn+A, A=C^m the number of different cycles z are computed. Every S leads to a cycle, so it can be conjectured that the number of cycles is infinite. But the number of different cycles seems to be finite. It is conjectured that the last new cycle occurs at the starting number S = B. This was tested with A=1; B=3; C=2 up to S=100000000. %F A096010 a(n) = A000016(n)+1. - _Vladeta Jovovic_, Feb 14 2006 %e A096010 a(9)=59 %Y A096010 A008965 is the same sequence as this with A = -C^m. %K A096010 nonn %O A096010 1,1 %A A096010 Peter Lengler (PeterLengler(AT)t-online.de), Jul 20 2004