W-0009
A superpermutation on 7 symbols, found by Robin Houston. It beat the previous record, W-0006, by 1 letter, and was the record for n = 7 from Aug 22, 2014 until Oct 19, 2018, when W-0010 was 4 letters shorter.
- Length
- 5,912
- Repeated occurrences
- 0
- Announced
- Aug 22, 2014
012345601234506123450162345012634501236450123465012340561234051623405126340512364051234605123406512340156234015263401523…
Windows
| 5,906 | windows of 7 consecutive letters | |
| = | 5,040 | distinct permutations, all 7! of them |
| + | 0 | repeated occurrences of a permutation |
| + | 866 | windows that are not permutations |
How it was found
Applying the recursive step to Houston's 872-letter word gives a word one shorter than 1! + ... + n! for every n >= 6; this file is the n = 7 case.
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) 220 bytes, or 5.9 kB decoded
Download text (.txt) 5.9 kB
# check it yourself
detour decode W-0009.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-0009.detour 5912
./target/release/bitmapcheck 7 ../W-0009.detour 5912
./target/release/wordhash 7 ../W-0009.detour 5912
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 128 tokens: 1 START, 1 literal of 1 byte in all, and 126 deviations. Deviations by weight, from 1 to 7: 0 · 0 · 126 · 0 · 0 · 0 · 0.