login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Table of n, a(n) for n=1..30.

K. Hicks et al., A polynomial analogue of the 3n+1 problem, Amer. Math. Monthly, 115 (2008), 615-622.

CROSSREFS

Sequence in context: A200182 A342173 A282277 * A342954 A015823 A049620

Adjacent sequences:  A122596 A122597 A122598 * A122600 A122601 A122602

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Aug 13 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 00:03 EDT 2021. Contains 343098 sequences. (Running on oeis4.)