|
Search: id:A008908
|
|
|
| A008908 |
|
Number of halving and tripling steps to reach 1 in `3x+1' problem. |
|
+0
11
|
|
| 1, 2, 8, 3, 6, 9, 17, 4, 20, 7, 15, 10, 10, 18, 18, 5, 13, 21, 21, 8, 8, 16, 16, 11, 24, 11, 112, 19, 19, 19, 107, 6, 27, 14, 14, 22, 22, 22, 35, 9, 110, 9, 30, 17, 17, 17, 105, 12, 25, 25, 25, 12, 12, 113, 113, 20, 33, 20, 33, 20, 20, 108, 108, 7, 28, 28, 28, 15, 15, 15, 103
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(A033496(n)) = A159999(A033496(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 04 2009]
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, E16.
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 04 2009]
J. C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly, 92 (1985), 3-23.
Index entries for sequences related to 3x+1 (or Collatz) problem
Dave's Integer Math Page, Integer Calculator: Compute 3x+1
|
|
FORMULA
|
a(n) = f(n,1) with f(n,x) = if n=1 then x else f(A006370(n),x+1). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 04 2009]
|
|
MATHEMATICA
|
Table[Length[NestWhileList[If[EvenQ[ # ], #/2, 3 # + 1] &, i, # != 1 &]], {i, 75}]
|
|
CROSSREFS
|
a(n) = A006577(n) + 1.
Sequence in context: A154928 A076123 A021783 this_sequence A050077 A133840 A081349
Adjacent sequences: A008905 A008906 A008907 this_sequence A008909 A008910 A008911
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), R. W. Gosper
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Apr 27 2001
|
|
|
Search completed in 0.002 seconds
|
