Graph Coloring · Challenge problem

The "book" graph $B_k$ has two hub vertices joined by an edge, plus $k$ further "page" vertices each joined to BOTH hubs ($2k+1$ edges on $k+2$ vertices total). With $4$ colors available, what is the smallest $k$ for which $B_k$ has more than $10{,}000$ proper colorings?