  
  
  [1m[4m[31mReferences[0m
  
  [33m[A00]  [0m[1m[31mAndaloro,  P.  [0m,  [34mOn  Total  Stopping Times under 3x+1 Iteration[0m,
  Fibonacci Quarterly, [34m38[0m (2000), 73-78
  
  [33m[G80]  [0m[1m[31mGrigorchuk,  R.  I.  [0m,  [34mBernside's  Problem  on  Periodic Groups[0m,
  Functional Anal. Appl., [34m14[0m (1980), 41-43
  
  [33m[K99]  [0m[1m[31mKeller,  T.  P.  [0m,  [34mFinite  Cycles of Certain Periodically Linear
  Permutations[0m, Missouri J. Math. Sci., [34m11[0m (3) (1999), 152-157
  
  [33m[K05]  [0m[1m[31mKohl, S. [0m, [34mRestklassenweise affine Gruppen[0m, Universität Stuttgart
  (2005)
  
  [33m[L06]  [0m[1m[31mLagarias,  J.  C.  [0m,  [34m3x+1 Problem Annotated Bibliography[0m (2006),
  (http://arxiv.org/abs/math.NT/0309224)
  
  [33m[LN02]  [0m[1m[31mLübeck,  F.  and  Neunhöffer,  M.  [0m, [34mGAPDoc (version 0.99)[0m, RWTH
  Aachen        (2002),       (GAP       package,       available       at
  http://www.math.rwth-aachen.de/~Frank.Luebeck)
  
  [33m[ML87]  [0m[1m[31mMatthews,  K.  R.  and  Leigh,  G.  M. [0m, [34mA Generalization of the
  Syracuse Algorithm in \(\GFq[x]\)[0m, J. Number Theory, [34m25[0m (1987), 274-278
  
  [33m[S02]  [0m[1m[31mSoicher,  L. [0m, [34mGRAPE -- GRaph Algorithms using PErmutation groups
  (version  4.1)[0m,  Queen  Mary, University of London (2002), (GAP package,
  available at http://www.gap-system.org)
  
  
  
  -------------------------------------------------------
