|
Search: id:A084268
|
|
|
| A084268 |
|
Triangle of counts of simple graphs on n nodes having chromatic number 1, ..., n. |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 1, 1, 6, 3, 1, 1, 12, 16, 4, 1, 1, 34, 84, 31, 5, 1, 1, 87, 579, 318, 52, 6, 1, 1, 302, 5721, 5366, 867, 81, 7, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
Eric Weisstein's World of Mathematics, n-Chromatic Graph
|
|
EXAMPLE
|
1; 1, 1; 1, 2, 1; 1, 6, 3, 1; ...
|
|
CROSSREFS
|
Cf. A076278, A076279, A076280, A076281, A076282, A076283, A084269.
Sequence in context: A085826 A112477 A156984 this_sequence A120258 A144351 A142589
Adjacent sequences: A084265 A084266 A084267 this_sequence A084269 A084270 A084271
|
|
KEYWORD
|
nonn,more,tabl
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), May 24, 2003
|
|
|
Search completed in 0.002 seconds
|
