Triangle read by rows: T(n,k) is the number of sensed combinatorial maps with n edges and k vertices, 1 <= k <= n + 1.
A380615
Triangle read by rows: T(n,k) is the number of sensed 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) =18a(11) =38a(12) =34a(13) =14a(14) =3a(15) =105a(16) =275a(17) =288a(18) =154a(19) =42a(20) =6a(21) =902a(22) =2614a(23) =3102a(24) =1959a(25) =705a(26) =140a(27) =14a(28) =9749a(29) =30346
External references
- oeis: A380615