login
A233138
Concatenated reversed shortest (x+1,2x)-codes for the positive integers.
4
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, 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, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2
OFFSET
1,2
COMMENTS
Concatenate the representations of the positive integers in A233137, and then separate the digits by commas.
LINKS
EXAMPLE
A233137 = (1,2,12,22,122,212,...), so that A233138 = (1,2,1,2,2,2,1,2,2,2,1,2,...)
MATHEMATICA
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 *)
Flatten[t] (* A233138 *)
Table[FromDigits[Reverse[u[n]]], {n, 1, 30}] (* A233135 *)
Flatten[Table[Reverse[u[n]], {n, 1, 30}]] (* A233136 *)
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Dec 05 2013
STATUS
approved