  The $r$-blowup of a graph $F$, denoted by $F[r]$, is the graph obtained by
replacing the vertices and edges of $F$ with independent sets of size $r$ and
copies of $K_{r,r}$, respectively. For bipartite graphs $F$, very little is
known about the order of magnitude of the Tur\'an number of $F[r]$. In this
paper we prove that $\mathrm{ex}(n,C_6[2])=O(n^{5/3})$ and, more generally, for
any positive integer $t$, $\mathrm{ex}(n,\theta_{3,t}[2])=O(n^{5/3})$. This is
tight when $t$ is sufficiently large.
