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 A374745 #20 Jun 02 2025 17:23:41 %S A374745 1,1,1,4,26,375,11495,613092,48185341,5116473573,698241355081 %N A374745 Number of unlabeled (3,6)-tight graphs with n vertices. %C A374745 A graph G=(V,E) is (3,6)-tight if |E|=3|V|-6 and for every subgraph G'=(V',E') with at least 3 vertices |E'|<=3|V'|-6. %C A374745 Every minimally rigid graph in 3D (A328419) is (3,6)-tight. %D A374745 A. Nixon and E. Ross, Inductive Constructions for Combinatorial Local and Global Rigidity, pages 413-434 of M. Sitharam, A. St. John and J. Sidman, editors, Handbook of Geometric Constraint System Principles, CRC Press, 2019. %H A374745 Georg Grasegger, <a href="https://doi.org/10.5281/zenodo.13768205">Dataset of (3,6)-tight graphs</a> %H A374745 Martin Larsson, <a href="https://github.com/martinkjlarsson/nauty-laman-plugin">Nauty Laman plugin</a> %e A374745 The triangle graph and the tetrahdral graph are (3,6)-tight. %o A374745 (nauty) gensparseg $n -K3 # With Laman plugin; see link. %Y A374745 Cf. A328419. %K A374745 nonn,more %O A374745 3,4 %A A374745 _Georg Grasegger_, Sep 16 2024 %E A374745 a(12)-a(13) added by _Georg Grasegger_, Oct 17 2024