A triangle sequence based on a prime root product using a primorial function: f(n)=primorial(n); p(x,n)=If[n == 0, 1, f(n)*(x + 1/f(n))*Product[x + Prime[i], {i, 1, n - 1}]]; t(n,m)=coefficients(p(x,n)).

A142583

A triangle sequence based on a prime root product using a primorial function: f(n)=primorial(n); p(x,n)=If[n == 0, 1, f(n)*(x + 1/f(n))*Product[x + Prime[i], {i, 1, n - 1}]]; t(n,m)=coefficients(p(x,n)).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =5a(5) =2a(6) =6a(7) =41a(8) =31a(9) =6a(10) =30a(11) =931a(12) =940a(13) =301a(14) =30a(15) =210a(16) =44347a(17) =51971a(18) =21227a(19) =3571a(20) =210a(21) =2310a(22) =5339027a(23) =6762728a(24) =3137268a(25) =665308a(26) =64681a(27) =2310a(28) =30030a(29) =901841261

External references