Triangle read by rows: T(n,k) is the number of embeddings on the sphere of planar graphs with n vertices and k faces having connectivity exactly 2 and minimum vertex degree at least 3, k=6..2n-5.
A378077
Triangle read by rows: T(n,k) is the number of embeddings on the sphere of planar graphs with n vertices and k faces having connectivity exactly 2 and minimum vertex degree at least 3, k=6..2n-5.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =7a(5) =2a(6) =1a(7) =8a(8) =35a(9) =60a(10) =47a(11) =12a(12) =0a(13) =5a(14) =72a(15) =307a(16) =647a(17) =652a(18) =325a(19) =59a(20) =0a(21) =3a(22) =86a(23) =776a(24) =3395a(25) =7647a(26) =9582a(27) =6654a(28) =2442a(29) =368
External references
- oeis: A378077