A 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).

A176561

A 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).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =7a(5) =1a(6) =1a(7) =18a(8) =18a(9) =1a(10) =1a(11) =38a(12) =90a(13) =38a(14) =1a(15) =1a(16) =75a(17) =360a(18) =360a(19) =75a(20) =1a(21) =1a(22) =145a(23) =1309a(24) =2609a(25) =1309a(26) =145a(27) =1a(28) =1a(29) =280

External references