|
Search: id:A006885
|
|
|
| A006885 |
|
Record highest point of trajectory before reaching 1 in `3x+1' problem, corresponding to starting values in A006884.
(Formerly M2086)
|
|
+0
11
|
|
| 1, 2, 16, 52, 160, 9232, 13120, 39364, 41524, 250504, 1276936, 6810136, 8153620, 27114424, 50143264, 106358020, 121012864, 593279152, 1570824736, 2482111348, 2798323360, 17202377752, 24648077896, 52483285312
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Both the 3x+1 steps and the halving steps are counted.
|
|
REFERENCES
|
R. B. Banks, Slicing Pizzas, Racing Turtles and Further Adventues in Applied Mathematics, Princeton Univ. Press, 1999. See p. 96.
B. Hayes, Computer Recreations: On the ups and downs of hailstone numbers, Scientific American, 250 (No. 1, 1984), pp. 10-16.
D. R. Hofstadter, Goedel, Escher, Bach: an Eternal Golden Braid, Random House, 1980, p. 400.
G. T. Leavens and M. Vermeulen, 3x+1 search problems, Computers and Mathematics with Applications, 24 (1992), 79-99.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..84 (from Eric Roosendaal's data)
J. C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly, 92 (1985), 3-23.
Eric Roosendaal, 3x+1 Path Records
Index entries for sequences from "Goedel, Escher, Bach"
Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
CROSSREFS
|
Cf. A006884, A006877, A006878, A033492.
Sequence in context: A058376 A120948 A090453 this_sequence A027273 A033431 A107610
Adjacent sequences: A006882 A006883 A006884 this_sequence A006886 A006887 A006888
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
mrob(AT)mrob.com (Robert P Munafo)
|
|
|
Search completed in 0.004 seconds
|
