|
Search: id:A076278
|
|
|
| A076278 |
|
Number of 2-chromatic (i.e. chromatic number equals 2) simple graphs on n nodes. |
|
+0
9
|
|
| 0, 1, 2, 6, 12, 34, 87, 302, 1118, 5478, 32302, 251134, 2527711, 33985852, 611846939, 14864650923, 488222721991, 21712049275197, 1308300679611468, 106897965189674290
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Keith M. Briggs, Combinatorial Graph Theory
Eric Weisstein's World of Mathematics, n-Chromatic Graph
|
|
FORMULA
|
a(n) = A033995(n)-1.
|
|
CROSSREFS
|
Cf. A076279, A076280, A076281, A076282, A115597.
Sequence in context: A096610 A164099 A088808 this_sequence A099576 A026549 A120766
Adjacent sequences: A076275 A076276 A076277 this_sequence A076279 A076280 A076281
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), Oct 06, 2002
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 31 2003
|
|
|
Search completed in 0.002 seconds
|
