login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243550 Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the bowtie graph. 0

%I #17 May 09 2019 14:52:56

%S 1,1,2,6,15,58,255,1510,10766,94109,945773,10577294

%N Number of simple connected graphs with n nodes that are planar and have no subgraph isomorphic to the bowtie 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 9766535.

%Y Cf. A242792 (bowtie 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)