|
%I #16 Apr 04 2024 11:42:53
%S 1,1,4,3,208,1,73,2,573,13,183,1,52,3583,4,3,108,6999,2,83,4974,13998,
%T 34177,3,378,208,108,34177,417208,8,903,3,52,27,213608,104302,1296224,
%U 8,68933,13,11253583,1158333,43,65189,30792,9947104,40507,2,6573998,27573
%N Main diagonal of A365991: the n-th term in the trajectory of n under the A185452 map.
%H Paolo Xausa, <a href="/A368301/b368301.txt">Table of n, a(n) for n = 1..10000</a>
%H Alex V. Kontorovich and Jeffrey C. Lagarias, <a href="https://arxiv.org/abs/0910.1944">Stochastic Models for the 3x+1 and 5x+1 Problems</a>, arXiv:0910.1944 [math.NT], 2009, and in Jeffrey C. Lagarias, ed., <a href="http://www.ams.org/bookstore-getitem/item=mbk-78">The Ultimate Challenge: The 3x+1 Problem</a>, American Mathematical Society, 2010, pp. 131-188.
%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%F a(n) = A365991(n,n-1).
%t A368301[n_]:=Nest[If[OddQ[#],(5#+1)/2,#/2]&,n,n-1];Array[A368301,100]
%Y Cf. A185452, A365991, A368300, A371691 (parity).
%K nonn,easy
%O 1,3
%A _Paolo Xausa_, Dec 20 2023
|
