|
|
A236525
|
|
Number of simple non-bipartite graphs on n nodes.
|
|
1
|
|
|
0, 0, 1, 4, 21, 121, 956, 12043, 273549, 11999689, 1018965561, 165090921457, 50502028840240, 29054155623249635, 31426485969192461828, 64001015704512693244004, 245935864153532444460997784, 1787577725145611678835828915650, 24637809253125004523074706811821299
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3) = 1 since the only non-bipartite graph on 3 vertices is the triangle.
|
|
PROG
|
(Sage) def a(n): return len([G for G in graphs(n) if not G.is_bipartite()])
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|