Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).

A100960

Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).

Terms

    a(0) =1a(1) =3a(2) =6a(3) =1a(4) =12a(5) =70a(6) =100a(7) =45a(8) =10a(9) =60a(10) =720a(11) =2445a(12) =3525a(13) =2637a(14) =1125a(15) =195a(16) =360a(17) =7560a(18) =46830a(19) =132951a(20) =210861a(21) =205905a(22) =123795a(23) =40950a(24) =5712a(25) =2520a(26) =84000a(27) =835800a(28) =3915240a(29) =10549168

External references