Irregular triangle read by rows: T(n,k) = number of crossing connected diagrams in a disk having n crossings and k vertices.

A232225

Irregular triangle read by rows: T(n,k) = number of crossing connected diagrams in a disk having n crossings and k vertices.

Terms

    a(0) =1a(1) =0a(2) =5a(3) =3a(4) =0a(5) =5a(6) =31a(7) =35a(8) =12a(9) =0a(10) =0a(11) =54a(12) =231a(13) =346a(14) =225a(15) =55a(16) =0a(17) =1a(18) =51a(19) =532a(20) =1942a(21) =3366a(22) =3062a(23) =1430a(24) =273a(25) =0a(26) =0a(27) =39a(28) =784a(29) =5253

External references