555828domain: NAppears in sequencesTriangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.at n=51A262494Unitary abundant numbers k such that k+2 is also unitary abundant.at n=15A292704