In reference to the Japanese anime series The Melancholy of Haruhi Suzumiya, the problem was presented on the imageboard as “The Haruhi Problem”: if you wanted to watch the 14 episodes of the first season of the series in every possible order, what would be the shortest string of episodes you would need to watch?
There is the Haruhi Problem, which proved a lower bound on superpermutations of sets n>5
https://en.m.wikipedia.org/wiki/Superpermutation
Holy fuck that’s amazing.
Wow! I stand corrected.