|
|
A212498
|
|
A finite sequence (of length 39) in which every permutation of [1..7] is a substring.
|
|
1
|
|
|
7, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 7, 6, 1, 2, 3, 4, 7, 5, 6, 1, 2, 3, 7, 4, 5, 6, 1, 2, 7, 3, 4, 5, 6, 1, 2, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
Adleman, Leonard. Short permutation strings. Discrete Math. 10(1974), 197--200. MR0373911 (51 #10111)
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|