How does one attack a divisibility problem like $(a+b)^2 \mid (2a^3+6a^2b+1)$? In my current line of investigation, I am running into [many] divisibility questions like the one in the title, i.e.
$$
  (a+b)^2 \mid (2a^3+6a^2b+1),  \qquad(\star)
$$
where $a > b \ge 1$ are integers. For example, maxima calculations suggest that $(\star)$ implies $(a,b)=(4,1)$.
I really haven't the first clue how to effectively attack this problem. Any pointers and references would be greatly appreciated.
EDIT: I've now cross-posted a partial solution to this. 
 A: $(a+b)^2|2a^3 +6a^2b+1$ iff $k(a^2+2ab+b^2) = 2a^3 +6a^2b+1$ or $-2a^3+a^2(k+6b)+a(2kb)+(kb^2+1)=0$. This is a a cubic equation so one could find $(a,b)$ by solving for $a$, but then one would still have to iterate through the $k$ and $b's$ to find an integer value of $a$ and $b$. This is also an elliptic curve, specifically $y^2 = -2a^3+a^2(k+6b)+a(2kb)+(kb^2+1)$. One could reduce this into Weiertrauss form using the cubic reduction formula to obtain something like $y^2 = a^3 + pa + q$. Anyway, elliptic curves have either finitely many or infinitely many solutions. We are searching for integer values of $a,b$ so we can apply what we know about solving for rational points on elliptic curves. If we are looking for rational points, then the rational points $E(\mathbb{Q})$ form an abelian group and is finitely generated, i.e. there is a finite number of rational points that one can use to find the rest of the points. 
Solving your problem is the same as finding rational points on an Elliptic Curve and there are lots of tricks to do that, many of which can be found online. As far as I know, there is no formula for solving elliptic curves, just methods to find solutions. However, your question is even more complicated than that, because two of values in your elliptic curve are undetermined. 
This link provides some examples of how to solve Elliptic Curves if your $k,b$ were determined. However, even with them determined, one would still use an algorithm to find the points. http://www.math.brown.edu/~jhs/Presentations/WyomingEllipticCurve.pdf
A: This is not even close to a complete solution, it will just help to reduce the number of calculations that you have to do on Maxima. 
Consider $2a^3 + 6a^2b + 1 \equiv 1 \pmod{2}$ and $(a+b)^2 \equiv 1 \pmod 2$. We also have that $2a^3 + 6a^2b + 1 \equiv 0 \pmod{3}$ and $(a+b)^2 \equiv 1 \pmod{3}$. Combining these we have that $a+b = 6k+1$ for some $k\in\mathbb{Z}$. 
