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 A385657 #15 Aug 13 2025 10:21:18 %S A385657 1,1,1,1,1,4,1,3,1,1,2,1,1,2,1,1,7,16,3,1,5 %N A385657 Number of nonisomorphic maximally dense unit-distance graphs on n vertices. %H A385657 Boris Alexeev, Dustin G. Mixon, and Hans Parshall, The Erdős unit distance problem for small point sets, <a href="https://arxiv.org/abs/2412.11914">arXiv:2412.11914</a> [math.CO], 2024. See pp. 1, 12. %H A385657 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ErdosUnitDistanceProblem.html">Erdos Unit Distance Problem</a>. %H A385657 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximallyDenseUnit-DistanceGraph.html">Maximally Dense Unit-Distance Graph</a>. %Y A385657 Cf. A186705 (number of edges in these graphs = solution to Erdos unit distance problem). %K A385657 nonn,hard,more %O A385657 1,6 %A A385657 _Eric W. Weisstein_, Aug 03 2025