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 #15 Jul 01 2018 10:43:01
%S 1,1,2,5,6,12,25,55,126,304,745,1893,4893,12916,34562,93844
%N Number of connected graphs with n nodes that are chordal and have no subgraph isomorphic to the bull 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 6c1dbe4
%Y Cf. A048192 (chordal graphs), A244427 (no bull subgraphs).
%K nonn,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Jun 27 2014
%E Definition corrected (connected only) by _Falk Hüffner_, Jul 01 2018
%E a(11)-a(16) added using tinygraph by _Falk Hüffner_, Jul 01 2018