Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138568 a(n) is the shortest substring containing all the permutations of {1,...,n} as (not necessarily adjacent) substrings. +0
1
1, 212, 3212321, 4321234321234, 543212345432123454321, 6543212345654321234565432123456, 7654321234567654321234567654321234567654321 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research