Least number k such that k mod (2, 3, 4, ... , n+1) = (d_n, d_n-1, ..., d_1), where d_1 , d_2, ..., d_n are the digits of k, with MSD(k) = d_1 and LSD(k) = d_n. 0 if such a number does not exist.

A284815

Least number k such that k mod (2, 3, 4, ... , n+1) = (d_n, d_n-1, ..., d_1), where d_1 , d_2, ..., d_n are the digits of k, with MSD(k) = d_1 and LSD(k) = d_n. 0 if such a number does not exist.