%I #14 Dec 21 2023 05:24:44
%S 1,2,3,3,1,8,4,8,3,4,5,2,4,8,2,6,13,1,2,4,1,7,3,33,3,1,2,3,8,18,8,83,
%T 8,3,1,8,9,4,9,4,208,4,8,3,4,10,23,2,23,2,104,2,4,8,2,11,5,58,1,58,1,
%U 52,1,2,4,1,12,28,13,29,3,29,3,26,3,1,2,3
%N Square array read by ascending antidiagonals: T(n,k) is the k-th iterate of the 5x+1 function started at n, with n >= 1 and k >= 0.
%C The 5x+1 function (A185452), denoted by T_5(x) in the literature, is defined as T_5(x) = (5x+1)/2 if x is odd, T_5(x) = x/2 if x is even.
%H Paolo Xausa, <a href="/A365991/b365991.txt">Table of n, a(n) for n = 1..11325</a> (antidiagonals 1..150 of the array, flattened)
%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>
%e The array begins:
%e n\k| 0 1 2 3 4 5 6 7 8 9 10 11 ...
%e --------------------------------------------------------------------
%e 1 | 1, 3, 8, 4, 2, 1, 3, 8, 4, 2, 1, 3, ...
%e 2 | 2, 1, 3, 8, 4, 2, 1, 3, 8, 4, 2, 1, ...
%e 3 | 3, 8, 4, 2, 1, 3, 8, 4, 2, 1, 3, 8, ...
%e 4 | 4, 2, 1, 3, 8, 4, 2, 1, 3, 8, 4, 2, ...
%e 5 | 5, 13, 33, 83, 208, 104, 52, 26, 13, 33, 83, 208, ...
%e 6 | 6, 3, 8, 4, 2, 1, 3, 8, 4, 2, 1, 3, ...
%e 7 | 7, 18, 9, 23, 58, 29, 73, 183, 458, 229, 573, 1433, ...
%e 8 | 8, 4, 2, 1, 3, 8, 4, 2, 1, 3, 8, 4, ...
%e 9 | 9, 23, 58, 29, 73, 183, 458, 229, 573, 1433, 3583, 8958, ...
%e 10 | 10, 5, 13, 33, 83, 208, 104, 52, 26, 13, 33, 83, ...
%e 11 | 11, 28, 14, 7, 18, 9, 23, 58, 29, 73, 183, 458, ...
%e 12 | 12, 6, 3, 8, 4, 2, 1, 3, 8, 4, 2, 1, ...
%e 13 | 13, 33, 83, 208, 104, 52, 26, 13, 33, 83, 208, 104, ...
%e 14 | 14, 7, 18, 9, 23, 58, 29, 73, 183, 458, 229, 573, ...
%e 15 | 15, 38, 19, 48, 24, 12, 6, 3, 8, 4, 2, 1, ...
%e ...
%t A365991list[dmax_]:=With[{a=Array[NestList[If[OddQ[#],(5#+1)/2,#/2]&,dmax-#,#]&,dmax,0]},Array[Diagonal[a,#]&,dmax,1-dmax]];A365991list[20] (* Generates 20 antidiagonals *)
%Y Cf. A185452, A347270, A365484, A365992 (parity), A368301 (main diagonal).
%K nonn,easy,tabl
%O 1,2
%A _Paolo Xausa_, Sep 25 2023
|