26771144426domain: NAppears in sequencesa(n) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1.at n=25A060401Smallest integer m greater than n such that m (mod k) == n (mod k) for k = 1..n-1.at n=25A195507