  
  
  [1XReferences[101X
  
  [[20XAnd00[120X]  [16XAndaloro,  P.[116X,  [17XOn  Total  Stopping  Times  under  3x+1  Iteration[117X,
  [18XFibonacci Quarterly[118X, [19X38[119X (2000), 73-78.
  
  [[20XBar15[120X]  [16XBartholdi,  L.[116X,  [17X  FR  --  Computations with functionally recursive
  groups.      Version      2.2.1     [117X     (2015),     ((     GAP     package,
  https://www.gap-system.org/Packages/fr.html )).
  
  [[20XdlH00[120X]  [16Xde la Harpe, P.[116X, [17XTopics in Geometric Group Theory[117X, Chicago Lectures
  in Mathematics (2000).
  
  [[20XEHN13[120X]  [16XEick,  B., Horn, M. and Nickel, W.[116X, [17X Polycyclic -- Computation with
  polycyclic    groups    (Version    2.11)   [117X   (2013),   ((   GAP   package,
  https://www.gap-system.org/Packages/polycyclic.html )).
  
  [[20XGKW16[120X] [16XGutsche, S., Kohl, S. and Wensley, C.[116X, [17X Utils - Utility functions in
  GAP      (Version      0.38)      [117X      (2016),      ((     GAP     package,
  https://www.gap-system.org/Packages/utils.html )).
  
  [[20XGri80[120X] [16XGrigorchuk, R. I.[116X, [17XBurnside's Problem on Periodic Groups[117X, [18XFunctional
  Anal. Appl.[118X, [19X14[119X (1980), 41-43.
  
  [[20XGT02[120X]  [16XGluck,  D.  and Taylor, B. D.[116X, [17XA New Statistic for the 3x+1 Problem[117X,
  [18XProc. Amer. Math. Soc.[118X, [19X130[119X, 5 (2002), 1293-1301.
  
  [[20XHEO05[120X]  [16XHolt, D. F., Eick, B. and O'Brien, E. A.[116X, [17XHandbook of Computational
  Group Theory[117X, Chapman & Hall / CRC, Boca Raton, FL, Discrete Mathematics and
  its Applications (Boca Raton) (2005), xvi+514 pages.
  
  [[20XHig74[120X] [16XHigman, G.[116X, [17XFinitely Presented Infinite Simple Groups[117X, Department of
  Pure  Mathematics,  Australian  National University, Canberra, Notes on Pure
  Mathematics (1974).
  
  [[20XKel99[120X]  [16XKeller,  T.  P.[116X,  [17XFinite  Cycles  of  Certain  Periodically  Linear
  Permutations[117X, [18XMissouri J. Math. Sci.[118X, [19X11[119X, 3 (1999), 152-157.
  
  [[20XKoh05[120X] [16XKohl, S.[116X, [17XRestklassenweise affine Gruppen[117X, Dissertation, Universität
  Stuttgart (2005), ((https://d-nb.info/977164071)).
  
  [[20XKoh07a[120X]  [16XKohl,  S.[116X,  [17X  Graph  Theoretical  Criteria  for  the  Wildness  of
  Residue-Class-Wise  Affine  Permutations  [117X (2007), (( Preprint (short note),
  https://www.gap-system.org/DevelopersPages/StefanKohl/preprints/graphcrit.pdf
  )).
  
  [[20XKoh07b[120X]  [16XKohl,  S.[116X,  [17X  Wildness  of Iteration of Certain Residue-Class-Wise
  Affine   Mappings   [117X,   [18XAdv.   in   Appl.  Math.[118X,  [19X39[119X,  3  (2007),  322-328,
  ((DOI: 10.1016/j.aam.2006.08.003)).
  
  [[20XKoh08[120X]  [16XKohl,  S.[116X, [17X Algorithms for a Class of Infinite Permutation Groups [117X,
  [18XJ. Symb. Comput.[118X, [19X43[119X, 8 (2008), 545-581, ((DOI: 10.1016/j.jsc.2007.12.001)).
  
  [[20XKoh10[120X]  [16XKohl,  S.[116X,  [17X  A Simple Group Generated by Involutions Interchanging
  Residue  Classes  of  the  Integers  [117X,  [18XMath.  Z.[118X,  [19X264[119X,  4 (2010), 927-938,
  ((DOI: 10.1007/s00209-009-0497-8)).
  
  [[20XKoh13[120X]  [16XKohl,  S.[116X,  [17X  Simple  Groups Generated by Involutions Interchanging
  Residue  Classes  Modulo  Lattices  in  Z^d [117X, [18XJ. Group Theory[118X, [19X16[119X, 1 (2013),
  81-86, ((DOI: 10.1515/jgt-2012-0031)).
  
  [[20XLag03[120X]  [16XLagarias,  J.  C.[116X,  [17XThe  3x+1  Problem:  An  Annotated Bibliography[117X
  (2003+),      ((     https://arxiv.org/abs/math.NT/0309224     (Part     I),
  https://arxiv.org/abs/math.NT/0608208 (Part II) )).
  
  [[20XLN12[120X]  [16XLübeck,  F.  and Neunhöffer, M.[116X, [17XGAPDoc (Version 1.5.1)[117X, RWTH Aachen
  (2012), (( GAP package, https://www.gap-system.org/Packages/gapdoc.html )).
  
  [[20XML87[120X]  [16XMatthews,  K. R. and Leigh, G. M.[116X, [17X A Generalization of the Syracuse
  Algorithm in GF(q)[x] [117X, [18XJ. Number Theory[118X, [19X25[119X (1987), 274-278.
  
  [[20XSoi16[120X]  [16XSoicher,  L.[116X,  [17XGRAPE  --  GRaph Algorithms using PErmutation groups
  (Version  4.7)[117X,  Queen  Mary,  University  of London (2016), (( GAP package,
  https://www.gap-system.org/Packages/grape.html )).
  
  
  
  [32X
