|
|
A233136
|
|
Concatenated shortest (x+1,2x)-codes for the positive integers.
|
|
4
|
|
|
1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Concatenate the representations of the positive integers in A233135, and then separate the digits by commas, in the manner analogous to A030302.
|
|
LINKS
|
|
|
EXAMPLE
|
A233135 = (1,2,21,22,221,212,...), so that A233136 = (1,2,2,1,2,2,2,2,1,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 *)
Table[FromDigits[Reverse[u[n]]], {n, 1, 30}] (* A233135 *)
Flatten[Table[Reverse[u[n]], {n, 1, 30}]] (* A233136 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|