|
| |
|
|
A084269
|
|
Triangle read by rows: counts of simple connected graphs on n nodes having chromatic number 1, ..., n.
|
|
1
| |
|
|
1, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 5, 12, 3, 1, 0, 17, 64, 26, 4, 1, 0, 44, 475, 282, 46, 5, 1, 0, 182, 5036, 5009, 809, 74, 6, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,8
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, n-Chromatic Graph
|
|
|
EXAMPLE
| 1; 0, 1; 0, 1, 1; 0, 3, 2, 1; ...
|
|
|
CROSSREFS
| Cf. A076284, A076285, A076286, A076287, A076288, A084268.
Sequence in context: A194885 A128317 A179753 * A051427 A194763 A194741
Adjacent sequences: A084266 A084267 A084268 * A084270 A084271 A084272
|
|
|
KEYWORD
| nonn,more,tabl
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com), May 24, 2003
|
| |
|
|
