A155558 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	6
3	138
4	10488
5	8280
6	2485656
7	1392696
8	1794643632
9	663449904
10	448448112
11	3910528474128
12	904634615952
13	375908525712
14	25621782562486656
15	3570752184568704
16	852504801992064
17	514242863174016
18	504057328351799983488

[1, 1, 6, 138, 10488, 8280, 2485656, 1392696, 1794643632, 663449904, 448448112, 3910528474128, 904634615952, 375908525712, 25621782562486656, 3570752184568704, 852504801992064, 514242863174016, 504057328351799983488]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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