|
Search: id:A122599
|
|
|
| A122599 |
|
Maximal number of iterations required for analogue of 3x+1 problem applied to polynomials of degree n over GF(2) to reach 1. |
|
+0
1
|
|
| 3, 6, 11, 14, 21, 24, 29, 34, 41, 48, 55, 58, 65, 72, 81, 86, 93, 100, 117, 122, 129, 132, 139, 152, 159, 166, 169, 180, 191, 198
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
K. Hicks et al., A polynomial analogue of the 3n+1 problem, Amer. Math. Monthly, 115 (2008), 615-622.
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
njas, Aug 13 2008
|
|
|
Search completed in 0.002 seconds
|
