Sub-exponentially many 3-colorings of triangle-free planar graphs

Thomassen conjectured that every triangle-free planar graph on n   vertices has exponentially many 3-colorings, and proved that it has at least 2n1/12/20000 distinct 3-colorings. We show that it has at least 2n/212 distinct 3-colorings.