n=7 of length 5907, or (n! + (n−1)! + (n−2)! + (n−3)! + n − 3) − 1, which was a new record. On 27 February 2019, using ideas developed by Robin Houston, Egan produced a superpermutation for n = 7 of length 5906. Whether similar shorter superpermutations also exist for values of n > 7 remains an open question. The current best lower bound (see section above) for n = 7 is still 5884. See also Superpattern, a permutation that contains each permutation of n symbols as a permutation pattern De Bruijn sequence, a similar problem with cyclic sequences Further reading References External links The Minimal Superpermutation Problem - Nathaniel Johnston's blog The 4chan post on /sci/, archived on warosu.org Tweet by Robin Houston, which brought attention to the 4chan post Combinatorics on words Enumerative combinatorics Permutations