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 #33 Dec 23 2022 11:22:34
%S 0,1,0,0,0,0,1,0,0,0,1,0,0,2,0,4,3,0,5,0,0,1,74,0,3,7,0,1,0,0,1,5,0,0,
%T 6,0,0,2,0,77,1,0,0,1,0,0,2,0,0,1,0,0,8,0,0,4,0,9,1,0,0,75,0,7,6,0,8,
%U 0,0,1,0,0,76,0,0,1,5418,0,1,0,0,2,0,0
%N a(n) is the least k >= 0 such that A359194^k(A358668(n)) = n (where A359194^k denotes the k-th iterate of A359194).
%H Rémy Sigrist, <a href="/A359214/b359214.txt">Table of n, a(n) for n = 0..10000</a>
%H Rémy Sigrist, <a href="/A359214/a359214.gp.txt">PARI program</a>
%F a(n) = 0 iff A358668(n) = n.
%F a(3*n+2) = 0. - _Thomas Scheuerle_, Dec 22 2022
%e The orbit of 0 under repeated application of A359194 is:
%e 0, 1, 0, ...
%e So a(0) = 0, a(1) = 1.
%e The orbit of 2 under repeated application of A359194 is:
%e 2, 1, 0, 1, 0, ...
%e So a(2) = 0.
%e The orbit of 3 under repeated application of A359194 is:
%e 3, 6, 13, 24, 55, 90, 241, 300, 123, 142, 85, 0, 1, 0, ...
%e So a(3) = 0, a(6) = 1, a(13) = 2, a(24) = 3, a(55) = 4, etc.
%t nn = 83; c[_] = -1; c[0] = 0; f[n_] := FromDigits[BitXor[1, IntegerDigits[3*n, 2]], 2]; Do[(MapIndexed[If[c[#1] == -1, Set[c[#1], First[#2] - 1]] &, #]; -1 + Length[#]) &@ NestWhileList[f, n, c[#] == -1 && # > 1 &], {n, 0, nn}]; Array[c, nn] (* _Michael De Vlieger_, Dec 23 2022 *)
%o (PARI) See Links section.
%Y Cf. A358668, A359194, A359226.
%Y Cf. A343858 (smallest numbers inside cyclic trajectories of the generalized Collatz function bx+c).
%K nonn,base
%O 0,14
%A _Rémy Sigrist_, Dec 22 2022