[seqfan] wording for digraphs A053763

[Richard J. Mathar]

Should the first comment in http://oeis.org/A053763 be changed to
"... labeled simple..", because the labeled digraphs (without multi-edges) are
actually counted in A002416?
My naive thinking is that there is a 1-to-1 map of the (0,1) nXn matrices
onto labelled graphs on n vertices. Taking the 2^(n^2) different (0,1)
matrices and then forcing the n diagonal elements to be zero (where
the loops are registered in the adjacency matrix), the
number of independent elements in the matrix shrinks from n^2 to n^2-n...

Richard Mathar