360375

Appears in sequences

• a(n) = n + n*(n-1)*(n-2)*(n-3)*(n-4).at n=15A001095
• 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=14A060401
• Smallest integer m greater than n such that m (mod k) == n (mod k) for k = 1..n-1.at n=14A195507