57432375domain: NAppears in sequencesa(n) is the least x such that tau(x) divides (x-1)^n but not (x-1)^(n-1), for n >= 2.at n=6A254409Alphabetic length of a divide-and-conquer approach to the regular expression for permutations of n symbols.at n=14A320460