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!)
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
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
Sequence in context: A368972 A365128 A127785 * A231257 A074541 A368974
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:20 EDT 2024. Contains 371235 sequences. (Running on oeis4.)