A134133 -id:A134133 - cp's OEIS frontend

A130561 Numbers associated to partitions, used for combinatoric interpretation of Lah triangle numbers A105278; elementary Schur polynomials / functions.

1, 2, 1, 6, 6, 1, 24, 24, 12, 12, 1, 120, 120, 120, 60, 60, 20, 1, 720, 720, 720, 360, 360, 720, 120, 120, 180, 30, 1, 5040, 5040, 5040, 5040, 2520, 5040, 2520, 2520, 840, 2520, 840, 210, 420, 42, 1, 40320, 40320, 40320, 40320, 20160, 20160, 40320, 40320, 20160

Offset: 1

Wolfdieter Lang, Jul 13 2007

The order of this array is according to the Abramowitz-Stegun (A-St) ordering of partitions (see A036036).
The row lengths sequence is A000041 (partition numbers) [1, 2, 3, 5, 7, 11, 15, 22, 30, 42, ...].
These numbers are similar to M_0, M_1, M_2, M_3, M_4 given in A111786, A036038, A036039, A036040, A117506, respectively.
Combinatorial interpretation: a(n,k) counts the sets of lists (ordered subsets) obtained from partitioning the set {1..n}, with the lengths of the lists given by the k-th partition of n in A-St order. E.g., a(5,5) is computed from the number of sets of lists of lengths [1^1,2^2] (5th partition of 5 in A-St order). Hence a(5,5) = binomial(5,2)*binomial(3,2) = 5!/(1!*2!) = 60 from partitioning the numbers 1,2,...,5 into sets of lists of the type {[.],[..],[..]}.
This array, called M_3(2), is the k=2 member of a family of partition arrays generalizing A036040 which appears as M_3 = M_3(k=1). S2(2) = A105278 (unsigned Lah number triangle) is related to M_3(2) in the same way as S2(1), the Stirling2 number triangle, is related to M_3(1). - Wolfdieter Lang, Oct 19 2007
Another combinatorial interpretation: a(n,k) enumerates unordered forests of increasing binary trees which are described by the k-th partition of n in the Abramowitz-Stegun order. - Wolfdieter Lang, Oct 19 2007
A relation between partition polynomials formed from these "refined Lah numbers" and Lagrange inversion for an o.g.f. is presented in the link "Lagrange a la Lah" along with an e.g.f. and an umbral binary operator tree representation. - Tom Copeland, Apr 12 2011
With the indeterminates (x_1,x_2,x_3,...) = (t,-c_2*t,-c_3*t,...) with c_n >0, umbrally P(n,a.) = P(n,t)|{t^n = a_n} = 0 and P(j,a.)P(k,a.) = P(j,t)P(k,t)|{t^n =a_n} = d_{j,k} >= 0 is the coefficient of x^j/j!*y^k/k! in the Taylor series expansion of the formal group law FGL(x,y) = f[f^{-1}(x)+f^{-1}(y)], where a_n are the inversion partition polynomials for calculating f(x) from the coefficients of the series expansion of f^{-1}(x) given in A133437. - Tom Copeland, Feb 09 2018
Divided by n!, the row partition polynomials are the elementary homogeneous Schur polynomials presented on p. 44 of the Bracci et al. paper. - Tom Copeland, Jun 04 2018
Also presented (renormalized) as the Schur polynomials on p. 19 of the Konopelchenko and Schief paper with associations to differential operators related to the KP hierarchy. - Tom Copeland, Nov 19 2018
Through equation 4.8 on p. 26 of the Arbarello reference, these polynomials appear in the Hirota bilinear equations 4.7 related to tau-function solutions of the KP hierarchy. - Tom Copeland, Jan 21 2019
These partition polynomials appear as Feynman amplitudes in their Bell polynomial guise (put x_n = n!c_n in A036040 for the indeterminates of the Bell polynomials) in Kreimer and Yeats and Balduf (e.g., p. 27). - Tom Copeland, Dec 17 2019
From Tom Copeland, Oct 15 2020: (Start)
With a_n = n! * b_n = (n-1)! * c_n for n  > 0, represent a function with f(0) = a_0 = b_0 = 1 as an
A) exponential generating function (e.g.f), or formal Taylor series: f(x) = e^{a.x} = 1 + Sum_{n > 0} a_n * x^n/n!
B) ordinary generating function (o.g.f.), or formal power series: f(x)  = 1/(1-b.x) = 1 + Sum_{n > 0}  b_n * x^n
C) logarithmic generating function (l.g.f): f(x) = 1 - log(1 - c.x) = 1 + Sum_{n > 0}  c_n * x^n /n.
Expansions of log(f(x)) are given in
I) A127671 and A263634 for the e.g.f: log[ e^{a.*x} ] =  e^{L.(a_1,a_2,...)x} = Sum_{n > 0} L_n(a_1,...,a_n) * x^n/n!, the logarithmic polynomials, cumulant expansion polynomials
II) A263916 for the o.g.f.: log[ 1/(1-b.x) ] =  log[ 1 - F.(b_1,b_2,...)x ] = -Sum_{n > 0} F_n(b_1,...,b_n) * x^n/n, the Faber polynomials.
Expansions of exp(f(x)-1) are given in
III) A036040 for an e.g.f: exp[ e^{a.x} - 1 ] = e^{BELL.(a_1,...)x}, the Bell/Touchard/exponential partition polynomials, a.k.a. the Stirling partition polynomials of the second kind
IV) A130561 for an o.g.f.: exp[ b.x/(1-b.x) ] = e^{LAH.(b.,...)x}, the Lah partition polynomials
V) A036039 for an l.g.f.: exp[ -log(1-c.x) ] =  e^{CIP.(c_1,...)x}, the cycle index polynomials of the symmetric groups S_n, a.k.a. the Stirling partition polynomials of the first kind.
Since exp and log are a compositional inverse pair, one can extract the indeterminates of the log set of partition polynomials from the exp set and vice versa. For a discussion of the relations among these polynomials and the combinatorics of connected and disconnected graphs/maps, see Novak and LaCroix on classical moments and cumulants and the two books on statistical mechanics referenced in A036040. (End)
These partition polynomials are referred to as Schur functions by Segal and Wilson, who present associations with Plucker coordinates, Grassmannians, and the tau functions of the KdV hierarchy. See pages 51 and 61. - Tom Copeland, Jan 08 2022

			Triangle starts:
  [  1];
  [  2,   1];
  [  6,   6,   1];
  [ 24,  24,  12, 12,  1];
  [120, 120, 120, 60, 60, 20, 1];
  ...
a(5,6) = 20 = 5!/(3!*1!) because the 6th partition of 5 in A-St order is [1^3,2^1].
a(5,5) = 60 enumerates the unordered [1^1,2^2]-forest with 5 vertices (including the three roots) composed of three such increasing binary trees: 5*((binomial(4,2)*2)*(1*2))/2! = 5*12 = 60.

E. Arbarello, "Sketches of KdV", Contemp. Math. 312 (2002), p. 9-69.

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].
P. Balduf, The propagator and diffeomorphisms of an interacting field theory, Master's thesis, submitted to the Institut für Physik, Mathematisch-Naturwissenschaftliche Fakultät, Humboldt-Universtität, Berlin, 2018.
F. Bracci, M. Contreras, S. Díaz-Madrigal, and A. Vasil'ev, Classical and stochastic Löwner-Kufarev equations, arXiv:1309.6423 [math.CV], 2013.
T. Copeland, Generators, Inversion, and Matrix, Binomial, and Integral Transforms
T. Copeland, Lagrange a la Lah
T. Copeland, Formal group laws and binomial Sheffer sequences, 2018.
T. Copeland, In the Realm of Shadows: Umbral inverses and associahedra, noncrossing partitions, symmetric polynomials, and similarity transforms, 2019.
G. Duchamp, Important formulas in combinatorics: The exponential formula, a Mathoverflow answer, 2015
T. Ernst, A history of the q-calculus and a new method, 2000.
B. Konopelchenko, Quantum deformations of associative algebras and integrable systems, arXiv:0802.3022 [nlin.SI], 2008.
D. Kreimer and K. Yeats, Diffeomorphisms of quantum fields, arXiv:1610.01837 [math-ph], 2016.
Wolfdieter Lang, Combinatorial Interpretation of Generalized Stirling Numbers, J. Int. Seqs. Vol. 12 (2009) 09.3.3.
Wolfdieter Lang, First 10 rows and more.
J. Novak and M. LaCroix, Three lectures on free probability, arXiv:1205.2097 [math.CO], 2012.
G. Segal and G. Wilson, Loop groups and equations of KdV type, Publications mathématiques de l’I.H.É.S., tome 61, 1985, p. 5-65.

Cf. A105278 (unsigned Lah triangle |L(n, m)|) obtained by summing the numbers for given part number m.
Cf. A000262 (row sums), identical with row sums of unsigned Lah triangle A105278.
A134133(n, k) = A130561(n, k)/A036040(n, k) (division by the M_3 numbers). - Wolfdieter Lang, Oct 12 2007
Cf. A036039, A263634, A263916.
Cf. A096162.
Cf. A133437.
Cf. A127671.

a(n,k) = n!/(Product_{j=1..n} e(n,k,j)!) with the exponent e(n,k,j) of j in the k-th partition of n in the A-St ordering of the partitions of n. Exponents 0 can be omitted due to 0!=1.
From Tom Copeland, Sep 18 2011: (Start)
Raising and lowering operators are given for the partition polynomials formed from A130561 in the Copeland link in "Lagrange a la Lah Part I" on pp. 22-23.
An e.g.f. for the partition polynomials is on page 3:
  exp[t*:c.*x/(1-c.*x):] = exp[t*(c_1*x + c_2*x^2 + c_3*x^3 + ...)] where :(...): denotes umbral evaluation of the enclosed expression and c. is an umbral coefficient. (End)
From Tom Copeland, Sep 07 2016: (Start)
The row partition polynomials of this array P(n,x_1,x_2,...,x_n), given in the Lang link, are n! * S(n,x_1,x_2,...,x_n), where S(n,x_1,...,x_n) are the elementary Schur polynomials, for which d/d(x_m) S(n,x_1,...,x_n) = S(n-m,x_1,...,x_(n-m)) with S(k,...) = 0 for k < 0, so d/d(x_m) P(n,x_1,...,x_n) = (n!/(n-m)!) P(n-m,x_1,...,x_(n-m)), confirming that the row polynomials form an Appell sequence in the indeterminate x_1 with P(0,...) = 1. See p. 127 of the Ernst paper for more on these Schur polynomials.
With the e.g.f. exp[t * P(.,x_1,x_2,..)] = exp(t*x_1) * exp(x_2 t^2 + x_3 t^3 + ...), the e.g.f. for the partition polynomials that form the umbral compositional inverse sequence U(n,x_1,...,x_n) in the indeterminate x_1 is exp[t * U(.,x_1,x_2,...)] = exp(t*x_1) exp[-(x_2 t^2 + x_3 t^3 + ...)]; therefore, U(n,x_1,x_2,...,x_n) = P(n,x_1,-x_2,.,-x_n), so umbrally P[n,P(.,x_1,-x_2,-x_3,...),x_2,x_3,...,x_n] = (x_1)^n = P[n,P(.,x_1,x_2,...),-x_2,-x_3,...,-x_n]. For example, P(1,x_1) = x_1, P2(x_1,x_2) = 2 x_2 + x_1^2, and P(3,x_1,x_2,x_3) = 6 x_3 + 6 x_2 x_1 + x_1^3, then P[3,P(.,x_1,-x_2,...),x_2,x_3] = 6 x_3 + 6 x_2 P(1,x_1) + P(3,x_1,-x_2,-x_3) = 6 x_3 + 6 x_2 x_1 + 6 (-x_3) + 6 (-x_2) x_1 + x_1^3 = x_1^3.
From the Appell formalism, umbrally [P(.,0,x_2,x_3,...) + y]^n = P(n,y,x_2,x_3,...,x_n).
The indeterminates of the partition polynomials can also be extracted using the Faber polynomials of A263916 with -n * x_n = F(n,S(1,x_1),...,S(n,x_1,...,x_n)) = F(n,P(1,x_1),...,P(n,x_1,...,x_n)/n!). Compare with A263634.
Also P(n,x_1,...,x_n) = ST1(n,x_1,2*x_2,...,n*x_n), where ST1(n,...) are the row partition polynomials of A036039.
(End)

Name augmented by Tom Copeland, Dec 08 2022

A077365 Sum of products of factorials of parts in all partitions of n.

Original entry on oeis.org

1, 1, 3, 9, 37, 169, 981, 6429, 49669, 430861, 4208925, 45345165, 536229373, 6884917597, 95473049469, 1420609412637, 22580588347741, 381713065286173, 6837950790434781, 129378941557961565, 2578133190722896861, 53965646957320869469, 1183822028149936497501

Offset: 0

Vladeta Jovovic, Nov 30 2002

nonn

Row sums of arrays A069123 and A134133. Row sums of triangle A134134.

			The partitions of 4 are 4, 3+1, 2+2, 2+1+1, 1+1+1+1, the corresponding products of factorials of parts are 24,6,4,2,1 and their sum is a(4) = 37.
1 + x + 3 x^2 + 9 x^3 + 37 x^4 + 169 x^5 + 981 x^6 + 6429 x^7 + 49669 x^8 + ...

Alois P. Heinz, Table of n, a(n) for n = 0..450 (terms n = 0..70 from Vincenzo Librandi)
J.-P. Bultel, A, Chouria, J.-G. Luque and O. Mallet, Word symmetric functions and the Redfield-Polya theorem, 2013.

Cf. A006906, A074141, A256125, A265950.
Cf. A069123, A134133, A134134.
Cf. A051296 (with compositions instead of partitions).

b:= proc(n, i, j) option remember;
      `if`(n=0, 1, `if`(i<1, 0, b(n, i-1, j)+
      `if`(i>n, 0, j^i*b(n-i, i, j+1))))
    end:
a:= n-> b(n$2, 1):
seq(a(n), n=0..40);  # Alois P. Heinz, Aug 03 2013
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
       b(n, i-1)+`if`(i>n, 0, b(n-i, i)*i!)))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..30);  # Alois P. Heinz, May 11 2016

Table[Plus @@ Map[Times @@ (#!) &, IntegerPartitions[n]], {n, 0, 20}] (* Olivier Gérard, Oct 22 2011 *)
a[ n_] := If[ n < 0, 0, Plus @@ Times @@@ (IntegerPartitions[ n] !)] (* Michael Somos, Feb 09 2012 *)
nmax=20; CoefficientList[Series[Product[1/(1-k!*x^k),{k,1,nmax}],{x,0,nmax}],x] (* Vaclav Kotesovec, Mar 14 2015 *)
b[n_, i_, j_] := b[n, i, j] = If[n==0, 1, If[i<1, 0, b[n, i-1, j] + If[i>n, 0, j^i*b[n-i, i, j+1]]]]; a[n_] := b[n, n, 1]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Oct 12 2015, after Alois P. Heinz *)

N=66; q='q+O('q^N);
gf= 1/prod(n=1,N, (1-n!*q^n) );
Vec(gf)
/* Joerg Arndt, Oct 06 2012 */

G.f.: 1/Product_{m>0} (1-m!*x^m).
Recurrence: a(n) = 1/n*Sum_{k=1..n} b(k)*a(n-k), where b(k) = Sum_{d divides k} d*d!^(k/d).
a(n) ~ n! * (1 + 1/n + 3/n^2 + 12/n^3 + 67/n^4 + 457/n^5 + 3734/n^6 + 35741/n^7 + 392875/n^8 + 4886114/n^9 + 67924417/n^10), for coefficients see A256125. - Vaclav Kotesovec, Mar 14 2015
G.f.: exp(Sum_{k>=1} Sum_{j>=1} (j!)^k*x^(j*k)/k). - Ilya Gutkovskiy, Jun 18 2018

Unnecessarily complicated mma code deleted by N. J. A. Sloane, Sep 21 2009

A107106 Divide A036039(n) by A036040(n).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 6, 2, 1, 1, 1, 24, 6, 2, 2, 1, 1, 1, 120, 24, 6, 4, 6, 2, 1, 2, 1, 1, 1, 720, 120, 24, 12, 24, 6, 4, 2, 6, 2, 1, 2, 1, 1, 1, 5040, 720, 120, 48, 36, 120, 24, 12, 6, 4, 24, 6, 4, 2, 1, 6, 2, 1, 2, 1, 1, 1, 40320, 5040, 720, 240, 144, 720, 120, 48, 36, 24, 12, 8, 120, 24, 12

Offset: 1

Alford Arnold, May 12 2005

A107107 gives the row sums. - R. J. Mathar, Aug 13 2007

This array is the first one (K=1) of a family of partition number arrays called M31(1). For M31(2) see A134133 = M_3(2)/M_3.

			a(36) = 280/70 = 4.
As array: [1];[1,1];[2,1,1];[6,2,1,1,1];[24,6,2,2,1,1,1];[120,24,6,4,6,2,1,2,1,1,1];...

Jean-François Alcover after Wolfdieter Lang, Table of n, a(n) for n = 1..138
Wolfdieter Lang, First 10 rows of the array and more.

Cf. A107107.

sortAbrSteg := proc(L1,L2) local i ; if nops(L1) < nops(L2) then RETURN(true) ; elif nops(L2) < nops(L1) then RETURN(false) ; else for i from 1 to nops(L1) do if op(i,L1) < op(i,L2) then RETURN(false) ; fi ; od ; RETURN(true) ; fi ; end: M2overM3 := proc(L) local n,k,an,resul; n := add(i,i=L) ; resul := 1 ; for k from 1 to n do an := add(1-min(abs(j-k),1),j=L) ; resul := resul* (factorial(k-1))^an ; od ; end: A107106 := proc(n,k) local prts,m ; prts := combinat[partition](n) ; prts := sort(prts, sortAbrSteg) ; if k <= nops(prts) then M2overM3(op(k,prts)) ; else 0 ; fi ; end: for n from 1 to 10 do for k from 1 to combinat[numbpart](n) do a:=A107106(n,k) ; printf("%d,",a) ; od; od ; # R. J. Mathar, Aug 13 2007

aspartitions[n_] := Reverse /@ Sort[Sort /@ IntegerPartitions[n]];
A036039[n_] := n!/(Times @@ #)& /@ ((#! Range[n]^#)& /@ Function[par, Count[par, #]& /@ Range[n]] /@ aspartitions[n]);
runs[li : {__Integer}] := ((Length /@ Split[#]))&[Sort@li];
A036040[n_] := Module[{temp}, temp = Map[Reverse, Sort@(Sort /@ IntegerPartitions[n]), {1}]; Apply[Multinomial, temp, {1}]/Apply[Times, (runs /@ temp)!, {1}]];
T[n_] := A036039[n]/A036040[n];
Table[T[n], {n, 1, 10}] // Flatten
(* Jean-François Alcover, Jun 10 2023, after Wouter Meeussen in A036039 *)

a(n) = A036039(n) / A036040(n).

Corrected and extended by R. J. Mathar, Aug 13 2007

a(75) and a(76) swapped (first 36, then 24) by Wolfdieter Lang, Sep 22 2008

cp's OEIS Frontend

A134134 Triangle of numbers obtained from the partition array A134133.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A130561 Numbers associated to partitions, used for combinatoric interpretation of Lah triangle numbers A105278; elementary Schur polynomials / functions.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions

A077365 Sum of products of factorials of parts in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A107106 Divide A036039(n) by A036040(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A144880 Partition number array, called M31hat(3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A069123 Triangle formed as follows: For n-th row, n >= 0, record the A000041(n) partitions of n; for each partition, write down number of ways to arrange the parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

SageMath

Formula