Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).

A053979

Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =5a(5) =2a(6) =15a(7) =32a(8) =22a(9) =5a(10) =105a(11) =260a(12) =234a(13) =93a(14) =14a(15) =945a(16) =2589a(17) =2750a(18) =1450a(19) =386a(20) =42a(21) =10395a(22) =30669a(23) =36500a(24) =22950a(25) =8178a(26) =1586a(27) =132a(28) =135135a(29) =422232

External references