Multi-bifurcating recursion of a factorial type based on the MacMahon numbers A060187 as a triangle sequence: t(n,k) = A060187(n,m) from polynomials; f(n, m) = If[m <= Floor[n/2], f(m, 1)*f(n - m, 1)*t(n + 1, m)].
A155558
Multi-bifurcating recursion of a factorial type based on the MacMahon numbers A060187 as a triangle sequence: t(n,k) = A060187(n,m) from polynomials; f(n, m) = If[m <= Floor[n/2], f(m, 1)*f(n - m, 1)*t(n + 1, m)].
Terms
- a(0) =1a(1) =1a(2) =6a(3) =138a(4) =10488a(5) =8280a(6) =2485656a(7) =1392696a(8) =1794643632a(9) =663449904a(10) =448448112a(12) =904634615952a(13) =375908525712
External references
- oeis: A155558