|
| |
|
|
A072761
|
|
Minimal number of steps to reduce n to 1 using modified Collatz (or 3x+1) rule.
|
|
0
| |
|
|
0, 1, 7, 2, 5, 8, 8, 3, 11, 5, 9, 9, 8, 9, 9, 4, 9, 12, 14, 7, 7, 11, 12, 10
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| The modified rule is that you have the option to change x to 3x+1 even when x is even.
|
|
|
REFERENCES
| M. J. Halm, Sequences (Re)discovered, Mpossibilities 81 (Aug. 2002), p. 1.
|
|
|
LINKS
| Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
|
FORMULA
| As with original Collatz problem, integers are operated on by HOTPO (halve or triple plus one) operator in either of two ways:(1) a(n) = a/2 or (2) a(n) = 3n+1
|
|
|
EXAMPLE
| a(9) = 11 because tripling and adding one 3 times and then halving 8 times yields 9, 28, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1; very much faster than the original Collatz's 119 steps.
|
|
|
CROSSREFS
| Cf. A008577.
Sequence in context: A196764 A074457 A200237 * A127885 A006577 A073652
Adjacent sequences: A072758 A072759 A072760 * A072762 A072763 A072764
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Michael Joseph Halm (hierogamous(AT)lycos.com), Aug 08 2002
|
| |
|
|
