%I #37 Dec 16 2022 07:05:20
%S 1,1,6,0,0,1,10,0,3,0,0,1,0,0,9,0,0,1,5,0,3,0,0,1,3,0,95,0,0,1,0,0,3,
%T 0,0,1,3,0,12,0,0,1,8,0,3,0,0,1,0,0,5,0,0,1,7,0,3,0,0,1,0,0,13,0,0,1,
%U 0,0,3,0,0,1,3,0,8,0,0,1,9,0,1,0,0,1,0,0,7
%N Number of terms in Collatz (3x+1) trajectory of n that did not appear in previous trajectories.
%C For n > 2, n such that a(n) = 0 are termed impure (A134191), while n such that a(n) > 0 are termed pure (A061641). - _T. D. Noe_, Feb 23 2013
%C From _Robert G. Wilson v_, Feb 25 2017: (Start)
%C For a(n) to be equal to 0, n != 0 (mod 3),
%C For a(n) to be an even positive number, n = {3, 7} (mod 12),
%C For a(n) to be equal to 1, n = {0, 1, 2, 3, 6, 7, 9} (mod 12),
%C For a(n) to be equal to 3, n = {1, 3, 9} (mod 12),
%C For a(n) to be an odd number > 3, n = {3, 7} (mod 12).
%C [Note that the above conditions are necessary but not sufficient. - Editors, Dec 15 2017]
%C (End)
%C a(n) gives the number of new terms in the n-th row of A070165 (see A263716). - _Andrey Zabolotskiy_, Feb 27 2017
%H T. D. Noe, <a href="/A222118/b222118.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 a(n) = A006577(n) - A221956(n) + 1. - _Michel Lagneau_, Feb 23 2013
%e a(7) = 10, since trajectory of 7 includes 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, which did not appear in earlier trajectories.
%t Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]; found = {}; Table[c = Collatz[n]; r = Complement[c, found]; found = Union[found, c]; Length[r], {n, 100}] (* _T. D. Noe_, Feb 23 2013 *)
%o (Python)
%o s = set([1])
%o print(1)
%o for n in range(2, 100):
%o m, r = n, 0
%o while m not in s:
%o s.add(m)
%o m = (m//2 if m%2==0 else 3*m+1)
%o r += 1
%o print(r)
%o # _Andrey Zabolotskiy_, Feb 21 2017
%Y Cf. A006577, A061641, A070165, A134191, A177729, A221956, A222297, A263716.
%K nonn
%O 1,3
%A _Jayanta Basu_, Feb 23 2013