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!)
A287511 Number of simple connected perfect non-bipartite graphs on n vertices. 0
0, 0, 1, 3, 15, 88, 680, 7623, 126047, 3118189, 112367111, 5736020864 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..12.

Eric Weisstein's World of Mathematics, Bipartite Graph

Eric Weisstein's World of Mathematics, Connected Graph

Eric Weisstein's World of Mathematics, Perfect Graph

Eric Weisstein's World of Mathematics, Simple Graph

FORMULA

a(n) = A052433(n) - A005142(n), since all bipartite graphs are perfect. - Falk Hüffner, Aug 10 2017

CROSSREFS

Cf. A005142, A052433.

Sequence in context: A316666 A192253 A127785 * A231257 A074541 A074550

Adjacent sequences:  A287508 A287509 A287510 * A287512 A287513 A287514

KEYWORD

nonn,more

AUTHOR

Eric W. Weisstein, May 26 2017

EXTENSIONS

a(11)-a(12) from formula by Falk Hüffner, Aug 10 2017

STATUS

approved

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 August 8 19:29 EDT 2020. Contains 336298 sequences. (Running on oeis4.)