login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Cf. A212497.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 30 02:03 EDT 2020. Contains 337432 sequences. (Running on oeis4.)