Triangle read by rows: T(n,k) = number of labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class. The classes are interchangeable if k = n-k. Here n >= 2, k=1..n-1.

A123474

Triangle read by rows: T(n,k) = number of labeled bicolored nonseparable graphs with k points in one color class and n-k points in the other class. The classes are interchangeable if k = n-k. Here n >= 2, k=1..n-1.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =0a(4) =3a(5) =0a(6) =0a(7) =10a(8) =10a(9) =0a(10) =0a(11) =15a(12) =340a(13) =15a(14) =0a(15) =0a(16) =21a(17) =6965a(18) =6965a(19) =21a(20) =0a(21) =0a(22) =28a(23) =51296a(24) =246295a(25) =51296a(26) =28a(27) =0a(28) =0a(29) =36

External references