The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248927 Triangle read by rows: Lagrange (compositional) inversion of a function in terms of the coefficients of the Taylor series expansion of its reciprocal. 5
 1, 1, 2, 1, 6, 9, 1, 24, 72, 12, 16, 1, 120, 600, 300, 200, 50, 25, 1, 720, 5400, 5400, 2400, 450, 1800, 450, 60, 90, 36, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Coefficients for Lagrange (compositional) inversion of a function in terms of the Taylor series expansion of its shifted reciprocal. Complementary to A134264 for formal power series. A refinement of A141618 with row sums A000272. Given an invertible function f(t) analytic about t=0 with f(0)=0 and df(0)/dt not 0, form h(t) = t / f(t) and denote h_n = (n') as the coefficient of t^n/n! in h(t). Then the compositional inverse of f(t), g(t), as a formal Taylor series, or e.g.f., is given up to the first few orders by g(t)/t = [ 1 (0') ]        + [ 1 (0') (1') ] * t        + [ 2 (0') (1')^2 + 1 (0')^2 (2') ] * t^2/2!        + [ 6 (0') (1')^3 + 9 (0')^2 (1') (2') + 1 (0')^3 (3') ] * t^3/3!        + [24 (0') (1')^4 + 72 (0')^2 (1')^2 (2') + (0')^3 [12 (2')^2            + 16 (1') (3')] + (0')^4 (4')] * t^4/4!        + [120 (0')(1')^5 + 600 (0')^2 (1')^3(2') + (0')^3 [300 (1')(2')^2 + 200 ( 1')^2(3')] + (0')^4 [50 (2')(3') + 25 (1')(4')] + (0')^5 (5')] * t^5/5! + [720 (0')(1')^6 + (0')^2 (1')^4(2')+(0')^3 [5400 (1')^2(2')^2 + 2400 (1')^3(3')] + (0')^4 [450 (2')^3+ 1800 (1')(2')(3') + 450( 1')^2(4')]+ (0')^5 [60 (3')^2 + 90 (2')(4') + 36 (1')(5')] + (0')^6 (6')] * t^6/6! + ... .......... From Tom Copeland, Oct 28 2014: (Start) Expressing g(t) as a Taylor series or formal e.g.f. in the indeterminates h_n generates a refinement of A055302, which enumerates the number of labeled root trees with n nodes and k leaves, with row sum A000169. Operating with (1/n^2) d/d(1') = (1/n^2) d/d(h_1) on the n-th partition polynomial in square brackets above associated with t^n/n! generates the (n-1)-th partition polynomial. Multiplying the n-th partition polynomial here by (n + 1) gives the (n + 1)-th partition polynomial of A248120.  (End) These are also the coefficients in the expansion of a series related to the Lagrange reversion theorem presented in Wikipedia of which the Lagrange inversion formula about the origin is a special case. Cf. Copeland link. - Tom Copeland, Nov 01 2016 LINKS M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. FORMULA For j>1, there are P(j,m;a...) = j! / [ (j-m)! (a_1)! (a_2)! ... (a_(j-1))! ] permutations of h_0 through h_(j-1) in which h_0 is repeated (j-m) times; h_1, repeated a_1 times; and so on with a_1 + a_2 + ... + a_(j-1) = m. If, in addition, a_1 + 2 * a_2 + ... + (j-1) * a_(j-1) = j-1, then each distinct combination of these arrangements is correlated with a partition of j-1. T(j,k) is [(j-1)!/j]* P(j,m;a...) / [(2!)^a_2 (3!)^a_3 ... ((j-1)!)^a_(j-1) ] for the k-th partition of j-1. The partitions are in reverse order--from bottom to top--from the order in Abramowitz and Stegun (page 831). For example, from g(t) above, T(6,3) = [5!/6][6!/(3!*2!)]/(2!)^2 = 300 for the 3rd partition from the bottom under n=6-1=5 with m=3 parts, and T(6,5) = [5!/6][6!/4!]/(2!*3!) = 50. If the initial factorial and final denominator are removed and the partitions reversed in order, A134264 is obtained, a refinement of the Narayana numbers. For f(t) = t*e^(-t), g(t) = T(t), the Tree function, which is the e.g.f. of A000169, and h(t) = t/f(t) = e^t, so h_n = 1 for all n in this case; therefore, the row sums of A248927 are A000169(n)/n = n^(n-2) = A000272(n). Let W(x) = 1/(df(x)/dx)= 1/{d[x/h(x)]/dx}=1/{d[x/[h_0+h_1*x+ ...]]/dx}. Then the partition polynomials above are given by (1/n)(W(x)*d/dx)^n x, evaluated at x=0, and the compositional inverse of f(t) is g(t)=　exp(t*W(x)*d/dx) x, evaluated at x=0. Also, dg(t)/dt = W(g(t)). See A145271. With exp[x* PS(.,t)] = exp[t*g(x)]=exp[x*W(y)d/dy] exp(t*y) eval. at y=0, the raising (creation) and lowering (annihilation) operators defined by R PS(n,t) = PS(n+1,t) and L PS(n,t)= n * PS(n-1,t) are R = t * W(d/dt) and L =(d/dt)/h(d/dt)=(d/dt) 1/[(h_0)+(h_1)*d/dt+(h_2)*(d/dt)^2/2!+...], which will give a lowering operator associated to the refined f-vectors of permutohedra (cf. A133314 and A049019). Then  [dPS(n,z)/dz]/n  eval. at z=0 are the row partition polynomials of this entry. (Cf. A139605, A145271, and link therein to Mathemagical Forests for relation to planted trees on p. 13.) As noted in A248120 and A134264, this entry is given by the Hadamard product by partition of A134264 and A036038. For example, (1,4,2,6,1)*(1,4,6,12,24) = (1,16,12,72,24). - Tom Copeland, Nov 25 2016 EXAMPLE Matrix begins 1; 1; 2, 1; 6, 9, 1; 24, 72, 12, 16, 1; 120, 600, 300, 200, 50, 25, 1; 720, 5400, 5400, 2400, 450, 1800, 450, 60, 90, 36, 1; ... For f(t) = e^t-1, h(t) = t/f(t) = t/(e^t-1), the e.g.f. for the Bernoulli numbers, and plugging the Bernoulli numbers into the Lagrange inversion formula gives g(t) = t - t^2/2 + t^3/3 + ... = log(1+t). CROSSREFS Cf. A145271 Cf. A134264 and A248120, "scaled" versions of this Lagrange inversion. Cf. A036038. Sequence in context: A160581 A021465 A139526 * A176013 A263255 A145663 Adjacent sequences:  A248924 A248925 A248926 * A248928 A248929 A248930 KEYWORD nonn,tabf,more AUTHOR Tom Copeland, Oct 16 2014 STATUS approved

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

Last modified July 11 15:58 EDT 2020. Contains 335626 sequences. (Running on oeis4.)