Ramsey numbers of odd cycles versus larger even wheels

The generalized Ramsey number R(G1,G2) is the smallest positive integer N such that any red-blue coloring of the edges of the complete graph KN either contains a red copy of G1 or a blue copy of G2. Let Cm denote a cycle of length m and Wn denote a wheel with n+1 vertices. In 2014, Zhang, Zhang and Chen determined many of the Ramsey numbers R(C2k+1,Wn) of odd cycles versus larger wheels, leaving open the particular case where n=2j is even and k