%I A084269
%S A084269 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,
%T A084269 182,5036,5009,809,74,6,1
%N A084269 Triangle read by rows: counts of simple connected graphs on n nodes having 
               chromatic number 1, ..., n.
%H A084269 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               n-ChromaticGraph.html">n-Chromatic Graph</a>
%e A084269 1; 0, 1; 0, 1, 1; 0, 3, 2, 1; ...
%Y A084269 Cf. A076284, A076285, A076286, A076287, A076288, A084268.
%Y A084269 Sequence in context: A158459 A031251 A128317 this_sequence A051427 A098825 
               A111460
%Y A084269 Adjacent sequences: A084266 A084267 A084268 this_sequence A084270 A084271 
               A084272
%K A084269 nonn,more,tabl
%O A084269 0,8
%A A084269 Eric Weisstein (eric(AT)weisstein.com), May 24, 2003