|
Search: id:A084280
|
|
|
| A084280 |
|
Number of labeled 4-colorable (i.e. chromatic number <= 4) graphs on n nodes. |
|
+0
4
|
| |
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
S. R. Finch, Bipartite, k-colorable and k-colored graphs
Eric Weisstein's World of Mathematics, n-Colorable Graph
|
|
CROSSREFS
|
Cf. A047864, A084279, A084281, A084282.
Sequence in context: A153571 A086789 A066537 this_sequence A153534 A153563 A136283
Adjacent sequences: A084277 A084278 A084279 this_sequence A084281 A084282 A084283
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), May 25, 2003
|
|
|
Search completed in 0.002 seconds
|
