A212498 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

Table of n, a(n) for n=1..39.

CROSSREFS

Sequence in context: A021588 A224998 A222216 * A153103 A199782 A147708

Adjacent sequences: A212495 A212496 A212497 * A212499 A212500 A212501

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, May 19 2012

STATUS

approved