|
| |
|
|
A138568
|
|
a(n) is the shortest substring containing all the permutations of {1,...,n} as (not necessarily adjacent) substrings.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| The strings a(n) of the sequence are the only strings that follow a particular trend as shown by other string in the sequence. There are other strings of the same length but the strings do follor the same pattern as the one shown by all the strings in the sequence.
|
|
|
REFERENCES
| P.J. Koutas and T.C. Hu, Shortest String Containing All Permutations, Discrete Mathematics, Vol. 11, 1975, pp. 125-132.
|
|
|
LINKS
| Hu, T.C. and Koutas, P.J., Shortest Substring
|
|
|
FORMULA
| a(n) = n..1..n..1..n (repeat n to 1 and 1 to n alternating for n number of times)
|
|
|
EXAMPLE
| a(4)= 4321234321234 because it contains all the permutations of the string 1234 as 1234 present in master string a(4) as 432123432(1234), 1243 as 432(12)3(43)21234, 1432 as 432(1)23(432)1234, 1423 as 432(1)23(4)3(2)12(3)4, 4321 as (4321)234321234 as so on and so forth.
|
|
|
CROSSREFS
| Cf. A136094.
Sequence in context: A007942 A079794 A197106 * A201104 A092126 A085309
Adjacent sequences: A138565 A138566 A138567 * A138569 A138570 A138571
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Aniruddha Das (hi.annie.pal(AT)gmail.com), May 18 2008
|
| |
|
|
