|
|
A122599
|
|
Maximal number of iterations required for analog of 3x+1 problem applied to polynomials of degree n over GF(2) to reach 1.
|
|
0
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|