A051151 -id:A051151 - cp's OEIS frontend

A092082 Triangle of numbers related to triangle A092083; generalization of Stirling numbers of second kind A008277, Lah-numbers A008297, ...

1, 7, 1, 91, 21, 1, 1729, 511, 42, 1, 43225, 15015, 1645, 70, 1, 1339975, 523705, 69300, 4025, 105, 1, 49579075, 21240765, 3226405, 230300, 8330, 147, 1, 2131900225, 984172735, 166428990, 13820205, 621810, 15386, 196, 1, 104463111025

Offset: 1

Wolfdieter Lang, Mar 19 2004

a(n,m) := S2(7; n,m) is the seventh triangle of numbers in the sequence S2(k;n,m), k=1..6: A008277 (unsigned Stirling 2nd kind), A008297 (unsigned Lah), A035342, A035469, A049029, A049385, respectively. a(n,1)=A008542(n), n>=1.
a(n,m) enumerates unordered n-vertex m-forests composed of m plane increasing 7-ary trees. Proof based on the a(n,m) recurrence. See also the F. Bergeron et al. reference, especially Table 1, first row and Example 1 for the e.g.f. for m=1. - Wolfdieter Lang, Sep 14 2007
Also the Bell transform of A008542(n+1). For the definition of the Bell transform see A264428. - Peter Luschny, Jan 26 2016

			{1}; {7,1}; {91,21,1}; {1729,511,42,1}; ...

F. Bergeron, Ph. Flajolet and B. Salvy, Varieties of Increasing Trees, in Lecture Notes in Computer Science vol. 581, (1992), pp. 24-48.
P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem., arXiv:quant-phys/0402027, 2004.
P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, Phys. Lett. A 309 (2003) 198-205.
M. Janjic, Some classes of numbers and derivatives, JIS 12 (2009) 09.8.3
W. Lang, First 10 rows.
W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
Shi-Mei Ma, Some combinatorial sequences associated with context-free grammars, arXiv:1208.3104v2 [math.CO], 2012. - From N. J. A. Sloane, Aug 21 2012

Cf. A092084 (row sums), A092085 (alternating row sums).

# The function BellMatrix is defined in A264428.
# Adds (1, 0, 0, 0, ..) as column 0.
BellMatrix(n -> mul(6*k+1, k=0..n), 9); # Peter Luschny, Jan 26 2016

mmax = 9; a[n_, m_] := n!*Coefficient[Series[((-1 + (1 - 6*x)^(-1/6))^m)/m!, {x, 0, mmax}], x^n];
Flatten[Table[a[n, m], {n, 1, mmax}, {m, 1, n}]][[1 ;; 37]] (* Jean-François Alcover, Jun 22 2011, after e.g.f. *)
rows = 9;
t = Table[Product[6k+1, {k, 0, n}], {n, 0, rows}];
T[n_, k_] := BellY[n, k, t];
Table[T[n, k], {n, 1, rows}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jun 22 2018, after Peter Luschny *)

a(n, m) = sum(|A051151(n, j)|*S2(j, m), j=m..n) (matrix product), with S2(j, m) := A008277(j, m) (Stirling2 triangle). Priv. comm. with Wolfdieter Lang by E. Neuwirth, Feb 15 2001; see also the 2001 Neuwirth reference. See the general comment on products of Jabotinsky matrices given under A035342.

a(n, m) = n!*A092083(n, m)/(m!*6^(n-m)); a(n+1, m) = (6*n+m)*a(n, m)+ a(n, m-1), n >= m >= 1; a(n, m) := 0, n

E.g.f. for m-th column: ((-1+(1-6*x)^(-1/6))^m)/m!.

A008543 Sextuple factorial numbers: Product_{k=0..n-1} (6*k + 5).

Original entry on oeis.org

1, 5, 55, 935, 21505, 623645, 21827575, 894930575, 42061737025, 2229272062325, 131527051677175, 8549258359016375, 606997343490162625, 46738795448742522125, 3879320022245629336375, 345259481979861010937375, 32799650788086796039050625, 3312764729596766399944113125

Offset: 0

Joe Keane (jgk(AT)jgk.org)

Vincenzo Librandi, Table of n, a(n) for n = 0..300
Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), Article 00.2.4.

a(n) = A013988(n+1, 1) (first column of triangle).

Cf. A004994, A034787, A049308, A047058, A048994, A051151.

[Round(6^n*Gamma(n+5/6)/Gamma(5/6)): n in [0..20]]; // G. C. Greubel, Dec 03 2019

Maple
```
f := n->product( (6*k-1),k=0..n);
```

FoldList[Times,1,6Range[0,15]+5]  (* Harvey P. Dale, Feb 20 2011 *)
Table[6^n*Pochhammer[5/6, n], {n, 0, 20}] (* G. C. Greubel, Dec 03 2019 *)
CoefficientList[Series[(1 - 6x)^(-5/6), {x, 0, 20}], x] Range[0, 20]! (* Nikolaos Pantelidis, Jan 31 2023 *)

a(n)=prod(k=1,n,6*k-1) \\ Charles R Greathouse IV, Aug 17 2011

[6^n*rising_factorial(5/6, n) for n in (0..20)] # G. C. Greubel, Dec 03 2019

a(n) = 5*A034787(n) = (6*n-1)(!^6), n >= 1, a(0) := 1.
E.g.f.: (1 - 6*x)^(-5/6).
a(n) ~ 2^(1/2)*Pi^(1/2)*Gamma(5/6)^-1*n^(1/3)*6^n*e^-n*n^n*(1 + (1/72)*n^-1 + ...). - Joe Keane (jgk(AT)jgk.org), Nov 24 2001
G.f.: 1/(1-5x/(1-6x/(1-11x/(1-12x/(1-17x/(1-18x/(1-23x/(1-24x/(1-... (continued fraction). - Philippe Deléham, Jan 08 2012
a(n) = (-1)^n*Sum_{k=0..n} 6^k*s(n+1,n+1-k), where s(n,k) are the Stirling numbers of the first kind, A048994. - Mircea Merca, May 03 2012
G.f.: (1 - 1/Q(0))/x where Q(k) = 1 - x*(6*k-1)/(1 - x*(6*k+6)/Q(k+1)); (continued fraction). - Sergei N. Gladkovskii, Mar 20 2013
a(n) = 6^n * Gamma(n+5/6) / Gamma(5/6). - Vaclav Kotesovec, Jan 28 2015
D-finite with recurrence: a(n) +(-6*n+1)*a(n-1)=0. - R. J. Mathar, Jan 17 2020
From Nikolaos Pantelidis, May 22 2022: (Start)
G.f.: 1/G(0), where G(k) = 1 - (12*k+5)*x - 6*(k+1)*(6*k+5)*x^2/G(k+1) (a continued fraction);
which starts 1/(1-5*x-30*x^2/(1-17*x-132*x^2/(1-29*x-306*x^2/(1-41*x-552*x^2/(1-53*x-870*x^2/(1-65*x-1260*x^2/(1-...))))))) (a Jacobi continued fraction).
(End)
Sum_{n>=0} 1/a(n) = 1 + (e/6)^(1/6)*(Gamma(5/6) - Gamma(5/6, 1/6)). - Amiram Eldar, Dec 18 2022

A047058 a(n) = 6^n * n!.

Original entry on oeis.org

1, 6, 72, 1296, 31104, 933120, 33592320, 1410877440, 67722117120, 3656994324480, 219419659468800, 14481697524940800, 1042682221795737600, 81329213300067532800, 6831653917205672755200, 614848852548510547968000

Offset: 0

Joe Keane (jgk(AT)jgk.org)

For n >= 1, a(n) is the order of the wreath product of the symmetric group S_n and the Abelian group (C_6)^n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 07 2001
a(n) is the number of ways 3 members of each of n different teams can be arranged in a row so that members of the same team are together. - Geoffrey Critzer, Mar 30 2009
From Jianing Song, Mar 29 2021: (Start)
Number of n X n monomial matrices with entries 0, +/-1, +/-w, +/-w^2, where w = (-1 + sqrt(3)*i)/2 is a primitive 3rd root of unity.
a(n) is the order of the group U_n(Z[w]) = {A in M_n(Z[w]): A*A^H = I_n}, the group of n X n unitary matrices over the Eisenstein integers. Here A^H is the conjugate transpose of A. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..300
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 528.

Cf. A000142, A000165, A008542, A008543, A047053, A051151, A053103, A092515, A092727.

[6^n*Factorial(n): n in [0..20]]; // Vincenzo Librandi, Oct 05 2011

seq( 6^n*n!, n=0..20); # G. C. Greubel, Jun 08 2020

Table[6^n n!,{n,0,20}] (* Harvey P. Dale, Mar 30 2018 *)

a(n) = A051151(n+1, 0).
E.g.f.: 1/(1 - 6*x).
G.f.: 1/(1 -6*x/(1 - 6*x/(1 - 12*x/(1 - 12*x/(1 - 18*x/(1 - 18*x/(1 - 24*x/(1 - 24*x/(1 - 30*x/(1 - 30*x/(1 -... (continued fraction). - Philippe Deléham, Jan 08 2012
From Amiram Eldar, Jun 25 2020: (Start)
Sum_{n>=0} 1/a(n) = e^(1/6) (A092515).
Sum_{n>=0} (-1)^n/a(n) = e^(-1/6) (A092727). (End)

Name changed by Arkadiusz Wesolowski, Oct 04 2011

A051186 Generalized Stirling number triangle of first kind.

Original entry on oeis.org

1, -7, 1, 98, -21, 1, -2058, 539, -42, 1, 57624, -17150, 1715, -70, 1, -2016840, 657874, -77175, 4165, -105, 1, 84707280, -29647548, 3899224, -252105, 8575, -147, 1, -4150656720, 1537437132, -220709524, 16252369, -672280, 15778, -196, 1

Offset: 1

Wolfdieter Lang

T(n,m) = R_n^m(a=0, b=7) in the notation of the given 1962 reference.
T(n,m) is a Jabotinsky matrix, i.e., the monic row polynomials E(n,x) := Sum_{m=1..n} T(n,m)*x^m = Product_{j=0..n-1} (x-7*j), n >= 1, and E(0,x) := 1 are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).
From Petros Hadjicostas, Jun 07 2020: (Start)
For integers n, m >= 0 and complex numbers a, b (with b <> 0), the numbers R_n^m(a,b) were introduced by Mitrinovic (1961) and further examined by Mitrinovic and Mitrinovic (1962).
They are defined via Product_{r=0..n-1} (x - (a + b*r)) = Sum_{m=0..n} R_n^m(a,b)*x^m for n >= 0. As a result, R_n^m(a,b) = R_{n-1}^{m-1}(a,b) - (a + b*(n-1))*R_{n-1}^m(a,b) for n >= m >= 1 with R_1^0(a,b) = a, R_1^1(a,b) = 1, R_n^m(a,b) = 0 for n < m, and R_0^0(a,b) = 1.
With a = 0 and b = 1, we get the Stirling numbers of the first kind S1(n,m) = R_n^m(a=0, b=1) = A048994(n,m).
We have R_n^m(a,b) = Sum_{k=0}^{n-m} (-1)^k * a^k * b^(n-m-k) * binomial(m+k, k) * S1(n, m+k) for n >= m >= 0.
For the current array, T(n,m) = R_n^m(a=0, b=7) but with no zero row or column. (End)

			Triangle T(n,m) (with rows n >= 1 and columns m = 1..n) begins:
         1;
        -7,      1;
        98,    -21,      1;
     -2058,    539,    -42,    1;
     57624, -17150,   1715,  -70,    1;
  -2016840, 657874, -77175, 4165, -105, 1;
  ...
3rd row o.g.f.: E(3,x) = Product_{j=0..2} (x - 7*j) = 98*x - 21*x^2 + x^3.

G. C. Greubel, Rows n = 1..50 of the triangle, flattened
Wolfdieter Lang, First ten rows.
D. S. Mitrinovic, Sur une classe de nombres reliés aux nombres de Stirling, Comptes rendus de l'Académie des sciences de Paris, t. 252 (1961), 2354-2356.
D. S. Mitrinovic and R. S. Mitrinovic, Sur les nombres de Stirling et les nombres de Bernoulli d'ordre supérieur, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 43 (1960), 1-63.
D. S. Mitrinovic and R. S. Mitrinovic, Sur une classe de nombres se rattachant aux nombres de Stirling--Appendice: Table des nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 60 (1961), 1-15 and 17-62.
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 77 (1962), 1-77.
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 77 (1962), 1-77 [jstor stable version].

Cf. A000142, A045754 (unsigned row sums), A049209 (row sums), A051188.

The b=1..6 triangles are: A008275 (Stirling1 triangle), A039683, A051141, A051142, A051150, A051151.

[7^(n-k)*StirlingFirst(n,k): k in [1..n], n in [1..12]]; // G. C. Greubel, Feb 22 2022

Table[7^(n-k)*StirlingS1[n, k], {n,12}, {k,n}]//Flatten (* G. C. Greubel, Feb 22 2022 *)

flatten([[(-7)^(n-k)*stirling_number1(n,k) for k in (1..n)] for n in (1..12)]) # G. C. Greubel, Feb 22 2022

T(n, m) = T(n-1, m-1) - 7*(n-1)*T(n-1, m) for n >= m >= 1, T(n, m) = 0 for n < m, T(n, 0) = 0 for n >= 1, and T(0, 0) = 1.
T(n, 1) = A051188(n-1).
Sum_{k=0..n} T(n, k) = (-1)^(n-1)*A049209(n-1).
Sum_{k=0..n} (-1)^(n-k)*T(n, k) = A045754(n).
E.g.f. for m-th column of signed triangle: (log(1 + 7*x)/7)^m/m!.
T(n,m) = 7^(n-m)*S1(n,m) with the (signed) Stirling1 triangle S1(n,m) = A008275(n,m).
Bivariate e.g.f.-o.g.f.: Sum_{n,m >= 1} T(n,m)*x^n*y^m/n! = exp((y/7)*log(1 + 7*x)) - 1 = (1 + 7*x)^(y/7) - 1. - Petros Hadjicostas, Jun 07 2020
T(n, 0) = (-7)^(n-1)*A000142(n-1). - G. C. Greubel, Feb 22 2022

A051187 Generalized Stirling number triangle of the first kind.

Original entry on oeis.org

1, -8, 1, 128, -24, 1, -3072, 704, -48, 1, 98304, -25600, 2240, -80, 1, -3932160, 1122304, -115200, 5440, -120, 1, 188743680, -57802752, 6651904, -376320, 11200, -168, 1, -10569646080, 3425697792, -430309376, 27725824, -1003520, 20608, -224, 1

Offset: 1

Wolfdieter Lang

T(n,m)= R_n^m(a=0, b=8) in the notation of the given 1962 reference.
T(n,m) is a Jabotinsky matrix, i.e. the monic row polynomials E(n,x) := Sum_{m=1..n} T(n,m)*x^m = Product_{j=0..n-1} (x - 8*j), n >= 1, and E(0,x) := 1 are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).
From Petros Hadjicostas, Jun 07 2020: (Start)
For integers n, m >= 0 and complex numbers a, b (with b <> 0), the numbers R_n^m(a,b) were introduced by Mitrinovic (1961) and further examined by Mitrinovic and Mitrinovic (1962). Such numbers are related to the work of Nörlund (1924).
They are defined via Product_{r=0..n-1} (x - (a + b*r)) = Sum_{m=0..n} R_n^m(a,b)*x^m for n >= 0. As a result, R_n^m(a,b) = R_{n-1}^{m-1}(a,b) - (a + b*(n-1))*R_{n-1}^m(a,b) for n >= m >= 1 with R_1^0(a,b) = a, R_1^1(a,b) = 1, R_n^m(a,b) = 0 for n < m, and R_0^0(a,b) = 1.
With a = 0 and b = 1, we get the Stirling numbers of the first kind S1(n,m) = R_n^m(a=0, b=1) = A048994(n,m).
We have R_n^m(a,b) = Sum_{k=0}^{n-m} (-1)^k * a^k * b^(n-m-k) * binomial(m+k, k) * S1(n, m+k) for n >= m >= 0.
For the current array, T(n,m) = R_n^m(a=0, b=8) but with no zero row or column. (End)

			Triangle T(n,m) (with rows n >= 1 and columns m = 1..n) begins:
          1;
         -8,         1;
        128,       -24,       1;
      -3072,       704,     -48,       1;
      98304,    -25600,    2240,     -80,     1;
   -3932160,   1122304, -115200,    5440,  -120,    1;
  188743680, -57802752, 6651904, -376320, 11200, -168, 1;
  ...
3rd row o.g.f.: E(3,x) = Product_{j=0..2} (x - 8*j) = 128*x - 24*x^2 + x^3.

D. S. Mitrinovic, Sur une classe de nombres reliés aux nombres de Stirling, Comptes rendus de l'Académie des sciences de Paris, t. 252 (1961), 2354-2356.
D. S. Mitrinovic and R. S. Mitrinovic, Sur les polynômes de Stirling, Bulletin de la Société des mathématiciens et physiciens de la R. P. de Serbie, t. 10 (1958), 43-49.
D. S. Mitrinovic and R. S. Mitrinovic, Sur les nombres de Stirling et les nombres de Bernoulli d'ordre supérieur, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 43 (1960), 1-63.
D. S. Mitrinovic and R. S. Mitrinovic, Sur une classe de nombres se rattachant aux nombres de Stirling--Appendice: Table des nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 60 (1961), 1-15 and 17-62.
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 77 (1962), 1-77.
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 77 (1962), 1-77 [jstor stable version].
Niels Nörlund, Vorlesungen über Differenzenrechnung, Springer, Berlin, 1924.

First (m=1) column sequence is: A051189(n-1).
Row sums (signed triangle): A049210(n-1)*(-1)^(n-1).
Row sums (unsigned triangle): A045755(n).
The b=1..7 triangles are: A008275 (Stirling1 triangle), A039683, A051141, A051142, A051150, A051151, A051186.

T(n, m) = T(n-1, m-1) - 8*(n-1)*T(n-1, m) for n >= m >= 1; T(n, m) := 0 for n < m; T(n, 0) := 0 for n >= 1; T(0, 0) = 1.
E.g.f. for the m-th column of the signed triangle: (log(1 + 8*x)/8)^m/m!.
From Petros Hadjicostas, Jun 07 2020: (Start)
T(n,m) = 8^(n-m)*Stirling1(n,m) = 8^(n-m)*A048994(n,m) = 8^(n-m)*A008275(n,m) for n >= m >= 1.
Bivariate e.g.f.-o.g.f.: Sum_{n,m >= 1} T(n,m)*x^n*y^m/n! = exp((y/8)*log(1 + 8*x)) - 1 = (1 + 8*x)^(y/8) - 1. (End)

Showing 1-6 of 6 results.

cp's OEIS Frontend

A008542 Sextuple factorial numbers: Product_{k=0..n-1} (6*k+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A092082 Triangle of numbers related to triangle A092083; generalization of Stirling numbers of second kind A008277, Lah-numbers A008297, ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A008543 Sextuple factorial numbers: Product_{k=0..n-1} (6*k + 5).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A047058 a(n) = 6^n * n!.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A051186 Generalized Stirling number triangle of first kind.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Sage

Formula

A051187 Generalized Stirling number triangle of the first kind.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula