The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A243567 Number of simple connected graphs with n nodes that are have no subgraph isomorphic to diamond graph or the bowtie graph. 0

%I #15 Sep 23 2020 16:00:28

%S 1,1,2,4,10,36,141,784,5626,56249,774266,14750595

%N Number of simple connected graphs with n nodes that are have no subgraph isomorphic to diamond graph or 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 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. A242790 (diamond free graphs), A242792 (bowtie free 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_, Sep 23 2020

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 May 29 00:29 EDT 2024. Contains 372921 sequences. (Running on oeis4.)