|
%I #15 May 09 2019 14:51:59
%S 1,1,2,4,11,38,159,882,6242,55316,578130,6774786
%N Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to diamond graph.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535.
%Y Cf. A242790 (diamond free graphs), A003094 (planar graphs).
%K nonn,more
%O 1,3
%A _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014
%E a(11)-a(12) added using tinygraph by _Falk Hüffner_, May 09 2019
|
