TITLE: What are some correct results discovered with incorrect (or no) proofs?
QUESTION [76 upvotes]: Many famous results were discovered through non-rigorous proofs, with
correct proofs being found only later and with greater difficulty.  One that is well
known is Euler's 1737 proof that
$1+\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+\cdots =\frac{\pi^2}{6}$
in which he pretends that the power series for $\frac{\sin\sqrt{x}}{\sqrt{x}}$
is an infinite polynomial and factorizes it from knowledge of its roots.
Another example, of a different type, is the Jordan curve theorem. In this case,
the theorem seems obvious, and Jordan gets credit for realizing that it requires
proof. However, the proof was harder than he thought, and the first rigorous proof
was found some decades later than Jordan's attempt. Many of the basic theorems of topology are like this.
Then of course there is Ramanujan, who is in a class of his own when it
comes to discovering theorems without proving them.
I'd be interested to see other examples, and in your thoughts on what the examples reveal about the connection between discovery and proof. 
Clarification.  When I posed the question I was hoping for some explanations
for the gap between discovery and proof to emerge, without any hinting from me. Since this hasn't happened much yet, let me suggest some possible
explanations that I had in mind:
Physical intuition. This lies behind results such as the Jordan curve theorem,
Riemann mapping theorem, Fourier analysis.
Lack of foundations. This accounts for the late arrival of rigor in calculus, topology,
and (?) algebraic geometry.
Complexity.  Hard results cannot proved correctly the first time, only via a
series of partially correct, or incomplete, proofs. Example: Fermat's last theorem.
I hope this gives a better idea of what I was looking for. Feel free to edit your
answers if you have anything to add.

REPLY [2 votes]: The (sharp) bound on the number of non-repelling cycles of a rational map of a Riemann sphere, sometimes called Fatou-Shishikura inequality, is such an example. It says that a rational map $f: \hat{\mathbb{C}} \to \hat{\mathbb{C}}$ of degree $d \geq 2$ has at most $2d-2$ non-repelling (i.e., attracting or neutral) cycles. 
This bound was first stated (without proof or even any particular motivation) by Lucjan Emil Boettcher, in his paper ''Zasady rachunku iteracyjnego (czesc pierwsza i czesc druga) [Principles of iterational
calculus (part one and two)]", Prace Matematyczno Fizyczne, vol. X (1899-1900),
pp. 65-86, 86-101. In 1920 it was formulated independently by Pierre Fatou. He managed to prove a weaker estimate, by $4d-4$. Later Adrien Douady and John Hamal Hubbard proved the conjectured estimate in the case when $f$ is polynomial, and finally Mitsuhiro Shishikura proved it  in the general case, using the theory of quasiconformal surgery.
(Shishikura, Mitsuhiro: Surgery of complex analytic dynamical systems. In: Dynamical systems and nonlinear oscillations (Kyoto, 1985), 93-105, World Sci. Adv. Ser. Dynam. Systems, 1, World Sci. Publishing, Singapore, 1986). Subsequently, another proof was given by Adam L. Epstein: http://arxiv.org/pdf/math/9902158.pdf