|
Search: id:A095684
|
|
|
| A095684 |
|
Triangle read by rows. There are 2^(m-1) rows of length m, for m = 1, 2, 3, ... The rows are in lexicographic order. The rows have the property that the first entry is 1, the second distinct entry (reading from left to right) is 2, the third distinct entry is 3, etc. |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 2, 3, 3, 1, 2, 3, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 1, 1, 2, 2, 2, 1, 1, 2, 2, 3, 1, 1, 2, 3, 3, 1, 1, 2, 3, 4, 1, 2, 2, 2, 2, 1, 2, 2, 2, 3, 1, 2, 2, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
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
|
1, 11, 12, 111, 112, 122, 123, 1111, 1112, 1122, 1123, 1222, 1223, 1233, ...
The 8 strings of length 4 are 1111, 1112, 1122, 1123, 1222, 1223, 1233, 1234.
|
|
CROSSREFS
|
See A096299 for another version.
Sequence in context: A030612 A120698 A025919 this_sequence A064531 A037829 A117546
Adjacent sequences: A095681 A095682 A095683 this_sequence A095685 A095686 A095687
|
|
KEYWORD
|
nonn,easy,tabf
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 25 2004
|
|
|
Search completed in 0.002 seconds
|
