158022domain: NAppears in sequencesA symmetrical triangle recursion:q=6;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3).at n=40A176561The number of circular maps C(n) with n edges regardless of genus.at n=8A234278