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.
%I A245880 #20 Feb 16 2025 08:33:23 %S A245880 1,1,2,6,21,111,821,10423,236064,10375796 %N A245880 Number of distinct characteristic polynomials among all connected graphs on n nodes. %H A245880 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A245880 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 [math.CO], 2014. %H A245880 T. Hoppe and A. Petrone, <a href="http://doi.org/10.1016/j.dam.2015.07.017">Integer sequence discovery from small graphs</a>, Discr. Appl. Math. 201 (2016) 172-181. %H A245880 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CharacteristicPolynomial.html">Characteristic Polynomial</a> %Y A245880 Cf. A082104 (simple graphs, including disconnected ones, with unique characteristic polynomials). %K A245880 nonn,hard,more %O A245880 1,3 %A A245880 _Travis Hoppe_ and _Anna Petrone_, Aug 05 2014 %E A245880 Terms corrected by _Eric M. Schmidt_, Mar 20 2015