Sometimes to fall asleep, I'll count as high as I can, whilst skipping numbers that are not square-free. I get a little thrill when I get to skip over several numbers in a row - for example,
48,49,50 are all NOT square-free (48 is divisible by 2^2, 49 by 7^2, and 50 by 5^2).
This led me to wondering about the earliest example of adjacent numbers divisible by some arbitrary sequence of divisors.
Input is an ordered list
a = [a_0, a_1, ...] of strictly positive integers containing at least 1 element.
Output is the smallest positive integer
n with the property that
n+1, and more generally
n+k. If no such
n exists, the function/program's behavior is not defined.
 -> 15 [3,4,5] -> 3 [5,4,3] -> 55 [2,3,5,7] -> 158 [4,9,25,49] -> 29348 [11,7,5,3,2] -> 1518
This is code-golf; shortest result (per language) wins bragging rights. The usual loopholes are excluded.