|
Search: id:A084269
|
|
|
| A084269 |
|
Triangle read by rows: counts of simple connected graphs on n nodes having chromatic number 1, ..., n. |
|
+0
2
|
|
| 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; listen)
|
|
|
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: A158459 A031251 A128317 this_sequence A051427 A098825 A111460
Adjacent sequences: A084266 A084267 A084268 this_sequence A084270 A084271 A084272
|
|
KEYWORD
|
nonn,more,tabl
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), May 24, 2003
|
|
|
Search completed in 0.002 seconds
|
