Graphs and Degrees · Hard problem

A graph on $7$ vertices has degree sequence $4,3,3,2,2,1,1$ (such a graph exists). Counting every ordered pair (start vertex, end vertex) connected by SOME walk of length $2$ — i.e. summing every entry of $A^2$, including the diagonal — how many such walks are there in total?