One thing that may help, other than the obvious observation that x=0 and x=a-1 are always solutions, is that solutions (like these trivial two) come in pairs: that is, if [itex]x_0[/itex] is a solution, producing an integer [itex]n_0 = \frac {5x_0 + a} {6x_0 + 1}[/itex], then it's not hard to prove that [itex]x_1=n_0 - 1[/itex] is a solution too (which will produce the integer [itex]n_1=x_0+1[/itex]).
At least this cuts the search up to something on the order of the sqrt(a): now you need to iterate, from k=1 to a maximum of k=[itex]\lfloor \frac {2 + \sqrt{4+6a}} 6 \rfloor[/itex], checking if [itex]a \equiv k+1 \pmod {6k+1}[/itex], in which case both x=k and x=[itex]\left( \frac {5k+a} {6k+1} - 1 \right)[/itex] are two new solutions (or one, if these two "dual" solutions happen to be the same).