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 A303792 #20 Feb 16 2025 08:33:54 %S A303792 1,1,2,5,13,50 %N A303792 Number of connected matchstick graphs on n nodes. %C A303792 a(7) >= 211. - _Eric W. Weisstein_, Jan 02 2022 %H A303792 Jaskaran Singh Grover, Changliu Liu and Katia Sycara, <a href="http://robotics.cs.rutgers.edu/wafr2020/wp-content/uploads/sites/7/2020/05/WAFR_2020_FV_36.pdf">Deadlock Analysis and Resolution for Multi-Robot Systems</a>, (2020). %H A303792 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConnectedGraph.html">Connected Graph</a> %H A303792 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MatchstickGraph.html">Matchstick Graph</a> %F A303792 a(6) = A059103(6) - 1. %F A303792 a(n) <= A059103(n). %e A303792 a(6) is one less than A059103(6) because the 3-prism graph Y_3 cannot be drawn in an embedding that is both planar and unit-distance. %e A303792 There are 11 connected graphs on 7 nodes that are unit-distance but non-matchstick (including Y_3+e and the Moser spindle). %Y A303792 Cf. A059103. %K A303792 nonn,hard,more %O A303792 1,3 %A A303792 _Eric W. Weisstein_, Apr 30 2018