|
Search: id:A062714
|
|
|
| A062714 |
|
Minimal length of a sequence with terms from {1, 2, 3, ..., n} which contains, as a subsequence, each possible ordering of the n symbols 1, 2, 3, ..., n. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
D. Galvin, The n-Part Trilogy Problem [BROKEN LINK]
|
|
EXAMPLE
|
1, 2, 3, 1, 2, 3, 1 contains as a subsequence all of 123, ..., 321, and is minimal, so a(3) = 7.
|
|
CROSSREFS
|
Sequence in context: A113578 A057992 A082600 this_sequence A057927 A056772 A024614
Adjacent sequences: A062711 A062712 A062713 this_sequence A062715 A062716 A062717
|
|
KEYWORD
|
nonn,bref,nice,more
|
|
AUTHOR
|
njas, Jul 14 2001
|
|
EXTENSIONS
|
Next term is 19 or 20.
|
|
|
Search completed in 0.002 seconds
|
