cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A338864 Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*x^n/n! = Product_{j>0} ( exp(x^j/(1 - x^j)) )^u.

This page as a plain text file.
%I A338864 #29 Nov 14 2020 11:04:05
%S A338864 1,4,1,12,12,1,72,96,24,1,240,840,360,40,1,2880,7200,4920,960,60,1,
%T A338864 10080,70560,65520,19320,2100,84,1,161280,745920,887040,362880,58800,
%U A338864 4032,112,1,1088640,7983360,12640320,6652800,1481760,150192,7056,144,1
%N A338864 Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*x^n/n! = Product_{j>0} ( exp(x^j/(1 - x^j)) )^u.
%C A338864 Also the Bell transform of A323295.
%H A338864 Peter Luschny, <a href="https://oeis.org/wiki/User:Peter_Luschny/BellTransform">The Bell transform</a>.
%F A338864 E.g.f.: exp(Sum_{n>0} u*d(n)*x^n), where d(n) is the number of divisors of n.
%F A338864 T(n; u) = Sum_{k=1..n} T(n,k)*u^k is given by T(n; u) = u * (n-1)! * Sum_{k=1..n} k*d(k)*T(n-k; u)/(n-k)!, T(0; u) = 1.
%F A338864 T(n,k) = (n!/k!) * Sum_{i_1,i_2,...,i_k > 0 and i_1+i_2+...+i_k=n} Product_{j=1..k} d(i_j).
%e A338864 exp(Sum_{n>0} u*d(n)*x^n) = 1 + u*x + (4*u+u^2)*x^2/2! + (12*u+12*u^2+u^3)*x^3/3! + ... .
%e A338864 Triangle begins:
%e A338864        1;
%e A338864        4,      1;
%e A338864       12,     12,      1;
%e A338864       72,     96,     24,      1;
%e A338864      240,    840,    360,     40,     1;
%e A338864     2880,   7200,   4920,    960,    60,    1;
%e A338864    10080,  70560,  65520,  19320,  2100,   84,   1;
%e A338864   161280, 745920, 887040, 362880, 58800, 4032, 112, 1;
%e A338864   ...
%t A338864 T[n_, 0] := Boole[n == 0]; T[n_, k_] := T[n, k] = Sum[Boole[j > 0] * Binomial[n - 1, j - 1] * j! * DivisorSigma[0, j] * T[n - j, k - 1], {j, 0, n - k + 1}]; Table[T[n, k], {n, 1, 9}, {k, 1, n}] // Flatten (* _Amiram Eldar_, Nov 13 2020 *)
%o A338864 (PARI) {T(n, k) = my(u='u); n!*polcoef(polcoef(prod(j=1, n, exp(x^j/(1-x^j+x*O(x^n)))^u), n), k)}
%o A338864 (PARI) a(n) = if(n<1, 0, n!*numdiv(n));
%o A338864 T(n, k) = if(k==0, 0^n, sum(j=0, n-k+1, binomial(n-1, j-1)*a(j)*T(n-j, k-1)))
%Y A338864 Column k=1..2 give A323295, (n!/2) * A055507(n-1).
%Y A338864 Rows sum give A294363.
%Y A338864 Cf. A000005 (d(n)), A338805, A338865, A338870.
%K A338864 nonn,tabl
%O A338864 1,2
%A A338864 _Seiichi Manyama_, Nov 13 2020