login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126265 Triangle of coefficients of q in e.g.f. that satisfies: A(x,q) = exp( q*x*A(q*x,q) ), read by rows of [n*(n-1)/2 + 1] terms in row n for n>=0. 7
1, 1, 1, 2, 1, 6, 3, 6, 1, 12, 24, 28, 24, 12, 24, 1, 20, 90, 140, 245, 120, 240, 140, 120, 60, 120, 1, 30, 240, 660, 1320, 1626, 1920, 2100, 1560, 1830, 1440, 1440, 840, 720, 360, 720, 1, 42, 525, 2450, 6195, 12432, 15127, 23310, 21000, 26250, 19320, 26502, 19320, 19740, 13440, 17850, 10080, 10080, 5880, 5040, 2520, 5040, 1, 56, 1008, 7336, 26320, 68208, 121072, 190968, 245616, 304080, 335440, 332136, 371616, 346136, 324240, 310800, 330960, 235200, 259056, 194880, 178080, 147840, 142800, 80640, 80640, 47040, 40320, 20160, 40320 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Row sums equals A000272(n+1) = (n+1)^(n-1). Last term in rows are the factorials. Coefficients of q in {[x^n] A(x,q)} when read backward converge to the sequence: [1,1/2,1,7/6,2,2,85/24,11/3,65/12,19/3,357/40,19/2,111/8,123/8,81/4,...].
LINKS
Alois P. Heinz, Rows n = 0..50, flattened (first 19 rows from Paul D. Hanna)
FORMULA
G.f.: A(x,q) = Sum_{n>=0} (x^n/n!) * q^n * Sum_{k=0..n*(n-1)/2} T(n,k)*q^k.
EXAMPLE
G.f.: A(x,q) = 1 + q*x + (1 + 2*q)*q^2*x^2/2! +
(1 + 6*q + 3*q^2 + 6*q^3)*q^3*x^3/3! +
(1 + 12*q + 24*q^2 + 28*q^3 + 24*q^4 + 12*q^5 + 24*q^6)*q^4*x^4/4! +
(1 + 20*q + 90*q^2 + 140*q^3 + 245*q^4 + 120*q^5 + 240*q^6 + 140*q^7 + 120*q^8 + 60*q^9 + 120*q^10)*q^5*x^5/5! +
(1 + 30*q + 240*q^2 + 660*q^3 + 1320*q^4 + 1626*q^5 + 1920*q^6 + 2100*q^7 + 1560*q^8 + 1830*q^9 + 1440*q^10 + 1440*q^11 + 840*q^12 + 720*q^13 + 360*q^14 + 720*q^15)*q^6*x^6/6! +
(1 + 42*q + 525*q^2 + 2450*q^3 + 6195*q^4 + 12432*q^5 + 15127*q^6 + 23310*q^7 + 21000*q^8 + 26250*q^9 + 19320*q^10 + 26502*q^11 + 19320*q^12 + 19740*q^13 + 13440*q^14 + 17850*q^15 + 10080*q^16 + 10080*q^17 + 5880*q^18 + 5040*q^19 + 2520*q^20 + 5040*q^21)*q^7*x^7/7! +...
This irregular triangle begins:
1;
1;
1, 2;
1, 6, 3, 6;
1, 12, 24, 28, 24, 12, 24;
1, 20, 90, 140, 245, 120, 240, 140, 120, 60, 120;
1, 30, 240, 660, 1320, 1626, 1920, 2100, 1560, 1830, 1440, 1440, 840, 720, 360, 720;
1, 42, 525, 2450, 6195, 12432, 15127, 23310, 21000, 26250, 19320, 26502, 19320, 19740, 13440, 17850, 10080, 10080, 5880, 5040, 2520, 5040;
1, 56, 1008, 7336, 26320, 68208, 121072, 190968, 245616, 304080, 335440, 332136, 371616, 346136, 324240, 310800, 330960, 235200, 259056, 194880, 178080, 147840, 142800, 80640, 80640, 47040, 40320, 20160, 40320;
1, 72, 1764, 18648, 96894, 319536, 784980, 1420848, 2389977, 3140424, 4338432, 4618656, 5847408, 5619096, 6366528, 5687712, 6565104, 5579280, 6227424, 4985064, 5219424, 4445784, 4566240, 3522960, 3704400, 2540160, 2694384, 1935360, 1965600, 1330560, 1285200, 725760, 725760, 423360, 362880, 181440, 362880; ...
MAPLE
b:= proc(n) option remember; expand(`if`(n=0, 1, add(j*
binomial(n-1, j-1)*x^(j-1)*b(j-1)*b(n-j), j=1..n)))
end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b(n)):
seq(T(n), n=0..10); # Alois P. Heinz, Aug 17 2017
MATHEMATICA
b[n_] := b[n] = Expand[If[n == 0, 1, Sum[j*Binomial[n - 1, j - 1]*x^(j - 1)*b[j - 1]*b[n - j], {j, 1, n}]]];
T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, Exponent[p, x]}]][ b[n]];
Table[T[n], {n, 0, 10}] // Flatten (* Jean-François Alcover, Jun 04 2018, after Alois P. Heinz *)
PROG
(PARI) T(n, k)=local(A=x); for(i=1, n, A=x*exp(subst(A, x, q*x+x*O(x^n)))); if(k>n*(n-1)/2 || k<0, 0, Vec(Vec(A)[n+1]*n!+q*O(q^(n*(n+1)/2)))[k+1])
for(n=0, 9, for(k=0, n*(n-1)/2, print1(T(n, k), ", ")); print(""))
CROSSREFS
Cf. A000272 (row sums); diagonals: A126266, A126267.
Sequence in context: A171178 A100014 A062566 * A293182 A124441 A284475
KEYWORD
nonn,tabf
AUTHOR
Paul D. Hanna, Dec 22 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)