A symmetrical triangle recursion:q=5;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).

A176560

A symmetrical triangle recursion:q=5;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).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =6a(5) =1a(6) =1a(7) =16a(8) =16a(9) =1a(10) =1a(11) =35a(12) =85a(13) =35a(14) =1a(15) =1a(16) =71a(17) =351a(18) =351a(19) =71a(20) =1a(21) =1a(22) =140a(23) =1295a(24) =2590a(25) =1295a(26) =140a(27) =1a(28) =1a(29) =274

External references