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 A084656 #17 Mar 06 2023 08:02:45
%S A084656 0,1,1,1,1,3,3,5,11,15,27,54,94,181,369,731,1502,3187
%N A084656 Number of unlabeled connected claw-free cubic graphs on 2n vertices.
%C A084656 A cubic graph is claw-free (contains no induced K_{1,3}) if and only if every vertex lies in a triangle. All graphs counted are simple (no loops or multiple edges).
%D A084656 A. Itzhakov and M. Codish, Breaking Symmetries with High Dimensional Graph Invariants and their Combination, Proceedings of the 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (2023).
%H A084656 Gordon Royle, <a href="http://www.csse.uwa.edu.au/~gordon/data.html">Combinatorial Data</a>.
%e A084656 K_4 is claw-free and so a(2) = 1, while the triangular prism is the only claw-free cubic graph on 6 vertices, so a(3) = 1.
%Y A084656 Cf. A084657, A084658, A057848.
%K A084656 nonn,more
%O A084656 1,6
%A A084656 _Gordon F. Royle_, Jun 02 2003
%E A084656 a(16)-a(18) from _Michael Codish_, Mar 05 2023