Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Apr 27 2019 07:36:12
%S 4,1,10,1,16,3,22,1,28,5,34,3,40,7,46,1,52,9,58,5,64,11,70,3,76,13,82,
%T 7,88,15,94,1,100,17,106,9,112,19,118,5,124,21,130,11,136,23,142,3,
%U 148,25,154,13,160,27,166,7,172,29,178,15,184,31,190,1,196,33,202,17,208,35,214,9,220,37,226,19,232
%N Modified Collatz Map such that odd numbers are treated the same, but even numbers have all factors of 2 removed.
%C All numbers that reach 1 under normal Collatz iteration will reach 1 through this mapping. This sequence combines all consecutive even number halvings into one step. This will decrease steps to completion compared to normal Collatz iteration for all starting points other than 1 and 2, drastically in most cases. If this mapping is applied upon A000265, the sequence generated when the even operation is applied initially, then further iteration through this modified mapping will have all entries synchronize to all either be odd or all be even for any given step.
%H Aidan Simmons, <a href="/A306546/b306546.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%F For any even n, a(n) = A000265(n). For any odd n, a(n) = 3n+1.
%o (PARI) a(n) = if (n%2, 3*n+1, n >> valuation(n, 2)); \\ _Michel Marcus_, Mar 05 2019
%Y Cf. A006370, A016777, A000265.
%K nonn,easy
%O 1,1
%A _Aidan Simmons_, Feb 22 2019