%I A115597
%S A115597 1,1,2,1,3,6,1,4,16,12,1,5,31,84,34,1,6,52,318,579,87,1,7,81,867,
%T A115597 5366,5721,302,1,8,118,2028,28722,155291,87381,1118,1,9,165,4251,
%U A115597 115391,1919895,7855628,2104349,5478
%N A115597 Triangle read by rows: let a(n,k) = number of graphs on n nodes with
chromatic number k; T(n,k) = a(n,n-k), n >= 2, k=0..n-2.
%H A115597 Keith M. Briggs, <a href="http://keithbriggs.info/cgt.html">Combinatorial
Graph Theory</a>
%e A115597 Table of values of a(n,k): number of graphs on n nodes with chromatic
number k
%e A115597 n. = .1...2...3...4....5....6.....7......8........9.......10
%e A115597 k.----------------------------------------------------------
%e A115597 2....0...1...2...6...12...34....87....302.....1118.....5478... = A076278
%e A115597 3....0...0...1...3...16...84...579...5721....87381..2104349... = A076279
%e A115597 4....0...0...0...1....4...31...318...5366...155291..7855628... = A076280
%e A115597 5....0...0...0...0....1....5....52....867....28722..1919895... = A076281
%e A115597 6....0...0...0...0....0....1.....6.....81.....2028...115391... = A076282
%e A115597 7....0...0...0...0....0....0.....1......7......118.....4251
%e A115597 8....0...0...0...0....0....0.....0......1........8......165
%e A115597 9....0...0...0...0....0....0.....0......0........1........9
%e A115597 10...0...0...0...0....0....0.....0......0........0........1
%e A115597 Triangle begins:
%e A115597 1
%e A115597 1 2
%e A115597 1 3 6
%e A115597 1 4 16 12
%e A115597 1 5 31 84 34
%e A115597 1 6 52 318 579 87
%e A115597 1 7 81 867 5366 5721 302
%e A115597 1 8 118 2028 28722 155291 87381 1118
%e A115597 1 9 165 4251 115391 1919895 7855628 2104349 5478
%Y A115597 Cf. A076278-A076282.
%Y A115597 Sequence in context: A035206 A115196 A093346 this_sequence A103371 A120257
A059298
%Y A115597 Adjacent sequences: A115594 A115595 A115596 this_sequence A115598 A115599
A115600
%K A115597 nonn,tabl
%O A115597 2,3
%A A115597 N. J. A. Sloane (njas(AT)research.att.com), based on email from Keith
Briggs, Mar 14 2006
|
