Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jan 17 2016 11:28:23
%S 1,1,2,5,10,27,70,206,613,1942,6259,20840,70528,243276,850281
%N Number of graphs with n nodes that are chordal and do not have a bowtie as a subgraph.
%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 [math.CO], 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 e8699da
%Y Cf. A048192 (chordal graphs), A242792 (bowtie free graphs).
%K nonn,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Jun 27 2014
%E a(11)-a(15) added using tinygraph by _Falk Hüffner_, Jan 17 2016