login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243563 Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to diamond graph. 0

%I

%S 0,0,1,3,10,35,162,964,7682,86994

%N Number of simple connected graphs with n nodes that are non-integral 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>

%Y Cf. A242790 (diamond-free graphs), A241842 (non-integral graphs).

%K nonn,more

%O 1,4

%A _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 15:27 EDT 2021. Contains 347658 sequences. (Running on oeis4.)