|
%I #11 Sep 29 2017 05:10:11
%S 3,6,11,14,21,24,29,34,41,48,55,58,65,72,81,86,93,100,117,122,129,132,
%T 139,152,159,166,169,180,191,198
%N Maximal number of iterations required for analog of 3x+1 problem applied to polynomials of degree n over GF(2) to reach 1.
%H K. Hicks et al., <a href="http://www.jstor.org/stable/27642557">A polynomial analogue of the 3n+1 problem</a>, Amer. Math. Monthly, 115 (2008), 615-622.
%K nonn,more
%O 1,1
%A _N. J. A. Sloane_, Aug 13 2008
|
