cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A245882 Number of distinct Laplacian polynomials among all connected graphs on n nodes.

This page as a plain text file.
%I A245882 #8 Feb 16 2025 08:33:23
%S A245882 1,1,2,6,21,110,793,10251,239307,10985229
%N A245882 Number of distinct Laplacian polynomials among all connected graphs on n nodes.
%C A245882 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 A245882 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A245882 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 A245882 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/LaplacianPolynomial.html">Laplacian Polynomial</a>
%K A245882 nonn,hard,more
%O A245882 1,3
%A A245882 _Travis Hoppe_ and _Anna Petrone_, Aug 05 2014