|
%I #14 Aug 14 2017 02:09:07
%S 1,2,1,3,2,1,4,2,1,5,4,2,1,6,3,2,1,7,6,3,2,1,8,4,2,1,9,8,4,2,1,10,5,4,
%T 2,1,11,10,5,4,2,1,12,6,3,2,1,13,12,6,3,2,1,14,7,6,3,2,1,15,14,7,6,3,
%U 2,1,16,8,4,2,1,17,16,8,4,2,1
%N Triangle in which n-th row gives trajectory of n under the map x -> x/2 if x is even, x -> x-1 if x is odd, stopping when we reach 1.
%C If you write down 0 when dividing by 2, 1 when subtracting 1, the trajectory gives the binary expansion of n.
%C The length of the n-th row of the triangle is A056792(n). - _Nathaniel Johnston_, Apr 21 2011
%H Nathaniel Johnston, <a href="/A082404/b082404.txt">Table of n, a(n) for n = 1..10000</a>
%F T(n, 1) = n, T(n, 2) = A029578(n).
%e Triangle begins:
%e 1;
%e 2, 1;
%e 3, 2, 1;
%e 4, 2, 1,
%e 5, 4, 2, 1;
%e 6, 3, 2, 1;
%e 7, 6, 3, 2, 1;
%e 8, 4, 2, 1;
%e 9, 8, 4, 2, 1;
%e ...
%p A082404 := proc(n,k) option remember: if(k = 1)then return n:elif(A082404(n,k-1) mod 2 = 0)then return A082404(n,k-1)/2: else return A082404(n,k-1)-1: fi: end:
%p for n from 1 to 20 do k:=1: while A082404(n,k)>=1 do printf("%d, ",A082404(n,k)); k:=k+1: od:printf("\n");od: # _Nathaniel Johnston_, Apr 21 2011
%Y Cf. A056792, A080825.
%K easy,nonn,tabf
%O 1,2
%A _Cino Hilliard_, Apr 14 2003
%E More terms and changed offset from _Nathaniel Johnston_, Apr 21 2011
|
