5045039

Appears in sequences

• a(n) = the smallest multiple of prime(n) such that a(n) == j-1 (mod j) for each integer j with 1 <= j < prime(n).at n=6A234423