|
Search: id:A070976
|
|
|
| A070976 |
|
Number of steps to reach 1 in `3x+1' (or Collatz) problem starting with 3^n. |
|
+0
1
|
|
| 0, 7, 19, 111, 22, 96, 33, 76, 75, 43, 135, 134, 133, 132, 144, 205, 129, 190, 140, 95, 94, 261, 428, 91, 258, 394, 331, 255, 254, 390, 389, 388, 462, 461, 460, 459, 458, 457, 456, 455, 454, 453, 501, 500, 450, 498, 497, 752, 495, 494, 493, 748, 491, 746, 489
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
For all n, it appears that a(n) <= 37n. For n > 22, it appears that a(n) < 16n. - T. D. Noe, Feb 02 2007
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..2000
|
|
FORMULA
|
a(n) = A075487(n+1) = A074472(n) + 1 - T. D. Noe, Feb 02 2007
|
|
PROGRAM
|
(PARI) for(n=2, 100, s=3^n; t=0; while(s!=1, t++; if(s%2==0, s=s/2, s=3*s+1); if(s==1, print1(t, ", "); ); ))
|
|
CROSSREFS
|
Equals A006577(3^n).
Adjacent sequences: A070973 A070974 A070975 this_sequence A070977 A070978 A070979
Sequence in context: A088883 A026574 A091149 this_sequence A096321 A128338 A107195
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 17 2002
|
|
|
Search completed in 0.002 seconds
|
