%I #7 Sep 14 2014 22:51:25
%S 1,1,2,6,21,110,793,10251,239307,10985229
%N Number of distinct Laplacian polynomials among all connected graphs on n nodes.
%C The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix, L = A-D where A is the adjacency matrix and D the degree matrix.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LaplacianPolynomial.html">Laplacian Polynomial</a>
%K nonn,hard,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Aug 05 2014