I was wondering if a question along the lines of the following would be appropriate for MO:

An open problem that seems to get a lot of attention every once in a while is the amenability of Thompsons group $F$.

The problem seems to generate both proofs and disproofs at a fairly high rate, compared to many other open problems.

What is more, it seems that a big part of these are actually serious attempts by serious mathematicians, rather than the "usual" elementary attempts one sees for the more famous problems.For examples, see for instance the MO question Is Thompson's Group F amenable? as well as (what as far as I can tell is the newest attempt, but I may have missed some) http://arxiv.org/abs/1408.2188.

Is there something inherent to this problem which causes this, i.e. some aspect that makes so many serious mathematicians convince themselves that they have a solution, and so many other serious mathematicians to take so long to find the errors?

Note that I am specifically not asking about what the errors were in previous attempts, unless there is some general type of error that tends to come up in many of them

I am asking here first, since this would to some extend be a soft question, and one which might not allow for a very definite answer.

Added: Given the positive response I will post the above version in about a day if there are no further comments.

Note: Question has been asked here: What makes the amenability of Thompsons group $F$ such a tricky problem?

veryexplicitly. -- People tend to interpret the question in their favorite way otherwise, as it happened e.g. with my question Mathematical research published in the form of poems, where answerers freely assert that e.g. medieval or ancient chinese poems have been published in a similar form as a paper in Math. Z.. $\endgroup$ – Stefan Kohl Nov 10 '14 at 13:50