A thrackle on a surfaceX is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once either at their common endpoint, or at a proper crossing. An unsolved conjecture of Conway (1969) asserts that (Formula presented.) for every thrackle on a sphere. Until now, the best known bound is (Formula presented.). By using discharging rules we show that (Formula presented.).