|
Search: id:A074769
|
|
|
| A074769 |
|
Least k such that the number of steps to reach 1 starting with k and iterating the Collatz process equals k/n or 0 if no k was found. |
|
+0
1
|
|
| 2, 21, 16, 40, 120, 238, 96, 261, 150, 0, 288, 767, 2002, 405, 160, 170, 2016, 0, 1980, 693, 1078, 2645, 0, 625, 650, 0, 784, 0, 3540, 341, 256, 1815, 2414, 0, 720, 0, 0, 1638, 1680, 1271, 966, 8127, 2552, 0, 0, 4841, 2160, 2205, 1300, 1326, 3588, 7685
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Least k such that A006577(k) = k/n
By definition, a(n) is divisible by n. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 01 2003
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, k=n; while(abs(if(k<0, 0, s=k; c=1; while((1-(s%2))*s/2+(s%2)*(3*s+1)>1, s=(1-(s%2))*s/2+(s%2)*(3*s+1); c++); c)-k/n)>0, k=k+n); k)
|
|
CROSSREFS
|
Sequence in context: A072397 A077208 A084313 this_sequence A140268 A106422 A077678
Adjacent sequences: A074766 A074767 A074768 this_sequence A074770 A074771 A074772
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 29 2002
|
|
EXTENSIONS
|
More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 01 2003
|
|
|
Search completed in 0.002 seconds
|
