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.

A243247 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to an open-bowtie graph.

This page as a plain text file.
%I A243247 #31 Jun 14 2025 22:16:17
%S A243247 0,0,0,0,10,78,755,10709,259123,11703831,1006591916,164058548700,
%T A243247 50335887082115
%N A243247 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to an open-bowtie graph.
%H A243247 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A243247 T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014
%H A243247 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CricketGraph.html">Cricket Graph</a>
%F A243247 a(n) = A001349(n) - A242791(n).
%e A243247 n=5: The ten simple (no loop) graphs satisfying the cricket (open bowtie) subgraph condition have vertex degrees: 4^5, 4^3 3^2, 4^2 3^2 2, 4^2 2^3, 4 3^4, 4 3^3 1, 4 3^2 2^2, 4 3 2^2 1, 4 2^4 (bowtie), 4 2^2 1^2 (cricket). - _Wolfdieter Lang_, Jun 08 2025
%K A243247 nonn,more
%O A243247 1,5
%A A243247 _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014
%E A243247 a(11)-a(13) added using formula by _Falk Hüffner_, Jan 16 2016