W-0006
A superpermutation on 7 symbols, found by Daniel A. Ashlock and Jenett Tillotson. It was the first record for n = 7, and held it from 1993 until Aug 22, 2014, when W-0009 was 1 letter shorter.
- Length
- 5,913
- Repeated occurrences
- 0
- Announced
- 1993
012345601234506123450162345012634501236450123465012340561234051623405126340512364051234605123406512340156234015263401523…
Windows
| 5,907 | windows of 7 consecutive letters | |
| = | 5,040 | distinct permutations, all 7! of them |
| + | 0 | repeated occurrences of a permutation |
| + | 867 | windows that are not permutations |
How it was found
The recursive-construction word on 7 symbols (the repository calls it 5913-palindromic).
Checking
| Program | Source | Result | Time |
|---|---|---|---|
| permcheck | c46d3654 | all 5,040 permutations appear | under 1 s |
| literal_check | f4687121 | agrees on coverage | under 1 s |
Download
Download Detour (.detour) 128 bytes, or 5.9 kB decoded
Download text (.txt) 5.9 kB
# check it yourself
detour decode W-0006.detour - | tr -d '\n' | shasum -a 256
tar xzf checkers-rs-source.tar.gz && cd checkers-rs && cargo build --release --locked
./target/release/classcheck 7 ../W-0006.detour 5913
./target/release/bitmapcheck 7 ../W-0006.detour 5913
./target/release/wordhash 7 ../W-0006.detour 5913
Decoding needs detour; see the Detour format for how to build and install it. The checkers are in checkers-rs-source.tar.gz, which needs Rust 1.89 or later; each one decodes the file itself, so the word is never written out.
The file's header gives n = 7 and sync exponent 0. The file has 2 tokens: 1 START, 1 literal of 1 byte in all, and 0 deviations. Deviations by weight, from 1 to 7: 0 · 0 · 0 · 0 · 0 · 0 · 0.