User blog:Ubersketch/Superpermutations

Superpermutations are strings that contain every permutation of n symbols as a substring. SP(n) = length of smallest superpermutation created by the permutations of an n-length string with n possible characters in the set of strings. SP(n,1) = length of smallest string containing the n smallest superpermutations created by the permutations of an n-length string with n possible characters in the set of strings. SP(n,2) = length of smallest string containing the n smallest strings containing the n smallest superpermutations created by the permutations of an n-length string with n possible characters in the set of strings. and so on...