Triangle read by rows: T(n,k) is the number of unsensed combinatorial maps with n edges and k vertices, 1 <= k <= n + 1.
A380616
Triangle read by rows: T(n,k) is the number of unsensed combinatorial maps with n edges and k vertices, 1 <= k <= n + 1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =1a(6) =5a(7) =8a(8) =5a(9) =2a(10) =17a(11) =33a(12) =30a(13) =13a(14) =3a(15) =79a(16) =198a(17) =208a(18) =118a(19) =35a(20) =6a(21) =554a(22) =1571a(23) =1894a(24) =1232a(25) =472a(26) =104a(27) =12a(28) =5283a(29) =16431
External references
- oeis: A380616