|
Search: id:A096299
|
|
|
| A096299 |
|
List of strings in lexicographic order with property that for the 2^(m-1) strings of length m, the first entry is 1, the second distinct entry (reading from left to right) is 2, the third distinct entry is 3, etc. |
|
+0
4
|
|
| 1, 11, 12, 111, 112, 122, 123, 1111, 1112, 1122, 1123, 1222, 1223, 1233, 1234, 11111, 11112, 11122, 11123, 11222, 11223, 11233, 11234, 12222, 12223, 12233, 12234, 12333, 12334, 12344, 12345, 111111, 111112, 111122, 111123, 111222, 111223
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
J. C. Kieffer, W. Szpankowski and E.-H. Yang, Problems on sequences: information theory and computer science interface, IEEE Trans. Inform. Theory, 50 (No. 7, 2004), 1385-1392.
|
|
EXAMPLE
|
The 8 strings of length 4 are 1111, 1112, 1122, 1123, 1222, 1223, 1233, 1234.
|
|
CROSSREFS
|
See A095684 for a better version. Different from A110382.
Sequence in context: A041258 A082262 A071159 this_sequence A110382 A095764 A110380
Adjacent sequences: A096296 A096297 A096298 this_sequence A096300 A096301 A096302
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Jun 25 2004
|
|
EXTENSIONS
|
More terms from John W. Layman (layman(AT)math.vt.edu), Oct 07 2004
|
|
|
Search completed in 0.002 seconds
|
