232792581

Appears in sequences

• a(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=20A060401
• Number of distinct functions from a set with n^n elements to itself that can be defined naturally (in n) by typed lambda-calculus expressions.at n=22A065500
• Smallest integer m greater than n such that m (mod k) == n (mod k) for k = 1..n-1.at n=20A195507