Walks, Paths and Connectivity · Challenge problem

A "fan" graph has a hub vertex $0$ joined to every vertex of the path $1,2,3,4,5,6$ (edges $12,23,34,45,56$), plus the $6$ spokes $01,02,03,04,05,06$. How many triangles does this graph contain?