Let n be an integer greater than 3. Let R be the set of lattice points (x,y) such that 0≤x,y≤n and ∣x−y∣≤3. Let An be the number of paths from (0,0) to (n,n) that consist only of steps of the form (x,y)→(x,y+1) and (x,y)→(x+1,y) and are contained entirely within R. Find the smallest positive real number that is greater than AnAn+1 for all n.