|
%I #4 Dec 07 2013 12:56:54
%S 1,2,1,2,2,2,1,2,2,2,1,2,1,2,1,2,2,2,2,1,2,2,2,2,1,2,2,1,2,1,2,2,2,2,
%T 1,2,1,2,2,1,2,2,1,2,1,2,1,2,1,2,1,2,2,2,2,2,1,2,2,2,2,2,1,2,2,2,1,2,
%U 1,2,2,2,2,2,1,2,2,1,2,2,1,2,2,2,1,2
%N Concatenated reversed shortest (x+1,2x)-codes for the positive integers.
%C Concatenate the representations of the positive integers in A233137, and then separate the digits by commas.
%H Clark Kimberling, <a href="/A233138/b233138.txt">Table of n, a(n) for n = 1..10000</a>
%e A233137 = (1,2,12,22,122,212,...), so that A233138 = (1,2,1,2,2,2,1,2,2,2,1,2,...)
%t b[x_] := b[x] = If[OddQ[x], x - 1, x/2]; u[n_] := 2 - Mod[Drop[FixedPointList[b, n], -3], 2]; u[1] = {1}; t = Table[u[n], {n, 1, 30}]; Table[FromDigits[u[n]], {n, 1, 50}] (* A233137 *)
%t Flatten[t] (* A233138 *)
%t Table[FromDigits[Reverse[u[n]]], {n, 1, 30}] (* A233135 *)
%t Flatten[Table[Reverse[u[n]], {n, 1, 30}]] (* A233136 *)
%Y Cf. A040039, A135529, A232559, A000045, A233135, A233137, A233138.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Dec 05 2013
|
