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.

A066951 Number of nonisomorphic connected graphs that can be drawn in the plane using n unit-length edges.

This page as a plain text file.
%I A066951 #62 Feb 16 2025 08:32:45
%S A066951 1,1,3,5,12,28,74,207,633,2008
%N A066951 Number of nonisomorphic connected graphs that can be drawn in the plane using n unit-length edges.
%C A066951 K_4 can't be so drawn even though it is planar. These graphs are a subset of those counted in A046091.
%D A066951 M. Gardner, The Unexpected Hanging and Other Mathematical Diversions. Simon and Schuster, NY, 1969, p. 80.
%D A066951 R. C. Read, From Forests to Matches, Journal of Recreational Mathematics, Vol. 1:3 (Jul 1968), 60-172.
%H A066951 Jean-Paul Delahaye, <a href="http://www.pourlascience.fr/ewb_pages/a/article-les-graphes-allumettes-33448.php">Les graphes-allumettes</a>, (in French), Pour la Science no. 445, November 2014.
%H A066951 Raffaele Salvia, <a href="http://arxiv.org/abs/1303.5965">A catalogue of matchstick graphs</a>, arXiv:1303.5965 [math.CO], 2013-2015.
%H A066951 Alexis Vaisse, <a href="http://alexis.vaisse.monsite-orange.fr/page-54b81c6bc01a2.html">Matchstick graphs</a>
%H A066951 Stefan Vogel and Mike Winkler, <a href="https://mikematics.de/matchstick-graphs-calculator.htm">Matchstick Graphs Calculator (MGC)</a>, a web application for the construction and calculation of unit distance graphs and matchstick graphs.
%H A066951 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MatchstickGraph.html">Matchstick Graph</a>
%e A066951 Up to five edges, every planar graph can be drawn with edges of length 1, so up to this point the sequence agrees with A046091 (connected planar graphs with n edges) [except for the fact that that sequence begins with no edges]. For six edges, the only graphs that cannot be drawn with edges of length 1 are K_4 and K_{3,2}. According to A046091, there are 30 connected planar graphs with 6 edges, so the sixth term is 28.
%Y A066951 Cf. A003055, A002905, A046091.
%K A066951 nonn,more,nice
%O A066951 1,3
%A A066951 _Les Reid_, May 25 2002
%E A066951 a(7) = 70. - _Jonathan Vos Post_, Jan 05 2007
%E A066951 Corrected, extended and reference added. a(7)=74 and a(8)=207 from Read's paper. - _William Rex Marshall_, Nov 16 2010
%E A066951 a(9) from Salvia's paper added by _Brendan McKay_, Apr 13 2013
%E A066951 a(9) corrected (from version 2 [May 22 2013] of Salvia's paper) by _Gaetano Ricci_, May 24 2013
%E A066951 a(10) from Vaisse's webpage added by _Raffaele Salvia_, Jan 31 2015