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!)
A363961 Number of connected non-quadratically embeddable graphs on n nodes. 1

%I #9 Jun 30 2023 18:32:46

%S 0,0,0,0,2,27,401,7943,234182

%N Number of connected non-quadratically embeddable graphs on n nodes.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/QuadraticallyEmbeddableGraph.html">Quadratically Embeddable Graph</a>

%F a(n) = A001349(n) - A363960(n).

%Y Cf. A363960 (quadratically embeddable graphs).

%K nonn,more

%O 1,5

%A _Eric W. Weisstein_, Jun 29 2023

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 July 31 17:27 EDT 2024. Contains 374808 sequences. (Running on oeis4.)