1016101domain: NAppears in sequencesLeast k (or 0 if no such k exists) such that 10^n+k is the least bemirp of a quartet of 4 different bemirps and the least bemirp of n+1 digits.at n=15A122568a(n) = Sum_{k=0..n-1} (Sum_{j=0..k+1} (-1)^j*binomial(n + 1, j)*(k + 1 - j)^n) mod 10 * 10^k.at n=6A141907