  We have exhaustively enumerated all simple, connected graphs of a finite
order and have computed a selection of invariants over this set. Integer
sequences were constructed from these invariants and checked against the Online
Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and 6
sequences were appended or corrected. From the graph database, we were able to
programmatically suggest relationships among the invariants. It will be shown
that we can readily visualize any sequence of graphs with a given criteria. The
code has been released as an open-source framework for further analysis and the
database was constructed to be extensible to invariants not considered in this
work.
