|
%I #15 Sep 23 2020 16:38:29
%S 1,1,2,4,9,30,89,379,1864,12365,106951,1272286,20722347
%N Number of simple connected graphs with n nodes that have no subgraph isomorphic to the open-bowtie graph or the diamond graph.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H 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, 2014
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 29e68fa.
%Y Cf. A242791 (open-bowtie free graphs), A242790 (diamond free graphs).
%K nonn,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Jun 16 2014
%E a(11)-a(13) added using tinygraph by _Falk Hüffner_, Sep 23 2020
|
