Triangle T(n,k) read by rows: number of n-node connected graphs with rectilinear crossing number k (k=0..A014540(n)).

A298446

Triangle T(n,k) read by rows: number of n-node connected graphs with rectilinear crossing number k (k=0..A014540(n)).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =20a(5) =1a(6) =99a(7) =11a(8) =1a(9) =1a(10) =646a(11) =149a(12) =38a(13) =15a(14) =1a(15) =2a(16) =1a(17) =0a(18) =0a(19) =1a(20) =5974a(21) =3008a(22) =1251a(23) =542a(24) =171a(25) =80a(26) =47a(27) =12a(28) =15a(29) =7

External references