A051150 -id:A051150 - cp's OEIS frontend

A008548 Quintuple factorial numbers: Product_{k=0..n-1} (5*k+1).

1, 1, 6, 66, 1056, 22176, 576576, 17873856, 643458816, 26381811456, 1213563326976, 61891729675776, 3465936861843456, 211422148572450816, 13953861805781753856, 990724188210504523776, 75295038303998343806976, 6098898102623865848365056, 524505236825652462959394816

Offset: 0

Joe Keane (jgk(AT)jgk.org)

a(n), n>=1, enumerates increasing sextic (6-ary) trees with n vertices. - Wolfdieter Lang, Sep 14 2007

Hankel transform is A169620. - Paul Barry, Dec 03 2009

Vincenzo Librandi, Table of n, a(n) for n = 0..300 (first 50 terms from T. D. Noe)
Martin Burtscher, Igor Szczyrba, Rafał Szczyrba, Analytic Representations of the n-anacci Constants and Generalizations Thereof, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.5.
Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), Article 00.2.4.
J.-C. Novelli and J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014-2020.
Maxie D. Schmidt, Generalized j-Factorial Functions, Polynomials, and Applications , J. Int. Seq. 13 (2010), Article 10.6.7, Table 6.3.

Cf. A001147, A007559, A007696, A016861, A034687, A034688, A052562, A047055, A049385, A051150.

List([0..20], n-> Product([0..n], k-> 5*k+1)); # G. C. Greubel, Aug 16 2019

[(&*[5*k+1: k in [0..n]]): n in [0..20]]; // G. C. Greubel, Aug 16 2019

a := n -> mul(5*k+1, k=0..n-1);
G(x):=(1-5*x)^(-1/5): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1],x) od: x:=0: seq(f[n],n=0..16); # Zerinvary Lajos, Apr 03 2009
H := hypergeom([1, 1/5], [], 5*x):
seq(coeff(series(H,x,20),x,n),n=0..16); # Peter Luschny, Oct 08 2015

Table[Product[5k+1,{k,0,n-1}],{n,0,20}]  (* Harvey P. Dale, Apr 23 2011 *)
FoldList[Times,1,NestList[#+5&,1,20]] (* Ray Chandler, Apr 23 2011 *)
FoldList[Times,1,5Range[0, 25] + 1] (* Vincenzo Librandi, Jun 10 2013 *)

x='x+O('x^33); Vec(serlaplace((1-5*x)^(-1/5))) \\ Joerg Arndt, Apr 24 2011

vector(20, n, n--; prod(k=0, n-1, 5*k+1)) \\ Altug Alkan, Oct 08 2015

[product(5*k+1 for k in (0..n)) for n in (0..20)] # G. C. Greubel, Aug 16 2019

a(n) = A049385(n, 1) (first column of triangle).
E.g.f.: (1-5*x)^(-1/5).
a(n) ~ 2^(1/2)*Pi^(1/2)*gamma(1/5)^-1*n^(-3/10)*5^n*e^-n*n^n*{1 + 1/300*n^-1 - ...}. - Joe Keane (jgk(AT)jgk.org), Nov 24 2001
a(n) = Sum_{k=0..n} (-5)^(n-k)*A048994(n, k). - Philippe Deléham, Oct 29 2005
G.f.: 1/(1-x/(1-5x/(1-6x/(1-10x/(1-11x/(1-15x/(1-16x/(1-20x/(1-21x/(1-25x/(1-.../(1-A008851(n+1)*x/(1-... (continued fraction). - Paul Barry, Dec 03 2009
a(n)=(-4)^n*Sum_{k=0..n} (5/4)^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/Q(0) where Q(k) = 1 - x*(5*k+1)/(1 - x*(5*k+5)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Mar 20 2013
G.f.: G(0)/2, where G(k)= 1  + 1/(1 - (5*k+1)*x/((5*k+1)*x + 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 14 2013
a(n) = (10n-18)*a(n-2) + (5n-6)*a(n-1), n>=2. - Ivan N. Ianakiev, Aug 12 2013
Let T(x) = 1/(1 - 4*x)^(1/4) be the e.g.f. for the sequence of triple factorial numbers A007696. Then the e.g.f. A(x) for the quintuple factorial numbers satisfies T( Integral_{t = 0..x} A(t) dt ) = A(x). Cf. A007559 and A007696. - Peter Bala, Jan 02 2015
O.g.f.: hypergeom([1, 1/5], [], 5*x). - Peter Luschny, Oct 08 2015
a(n) = 5^n * Gamma(n + 1/5) / Gamma(1/5). - Artur Jasinski, Aug 23 2016
D-finite with recurrence: a(n) +(-5*n+4)*a(n-1)=0. - R. J. Mathar, Jan 17 2020
Sum_{n>=0} 1/a(n) = 1 + (e/5^4)^(1/5)*(Gamma(1/5) - Gamma(1/5, 1/5)). - Amiram Eldar, Dec 19 2022

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

Original entry on oeis.org

1, 6, 1, 66, 18, 1, 1056, 372, 36, 1, 22176, 9240, 1200, 60, 1, 576576, 271656, 42840, 2940, 90, 1, 17873856, 9269568, 1685376, 142800, 6090, 126, 1, 643458816, 360847872, 73313856, 7254576, 386400, 11256, 168, 1, 26381811456, 15799069440

Offset: 1

Wolfdieter Lang

a(n,m) := S2(6; n,m) is the sixth triangle of numbers in the sequence S2(k; n,m), k=1..6: A008277 (unsigned Stirling 2nd kind), A008297 (unsigned Lah), A035342, A035469, A049029, respectively. a(n,1)= A008548(n).

a(n,m) enumerates unordered n-vertex m-forests composed of m plane increasing 6-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

			Triangle begins:
  {1};
  {6,1};
  {66,18,1};
  {1056,372,36,1};
  ...

F. Bergeron, Ph. Flajolet and B. Salvy, Varieties of Increasing Trees, Lecture Notes in Computer Science vol. 581, ed. J.-C. Raoult, Springer 1992, pp. 24-48. Added Mar 01 2014.
F. Bergeron, Philippe Flajolet and Bruno Salvy, Varieties of increasing trees, HAL, Rapport De Recherche Inria. Added Mar 01 2014.
P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, arXiv:quant-ph/0402027, 2004.
M. Janjic, Some classes of numbers and derivatives, JIS 12 (2009) 09.8.3
W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
W. Lang, First 10 rows.
Shi-Mei Ma, Some combinatorial sequences associated with context-free grammars, arXiv:1208.3104v2 [math.CO]. - From _N. J. A. Sloane_, Aug 21 2012
E. Neuwirth, Recursively defined combinatorial Functions: Extending Galton's board, Discr. Maths. 239 (2001) 33-51.

Cf. A049412.

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

a[n_, m_] := n!*Coefficient[Series[((-1 + (1 - 5*x)^(-1/5))^m)/m!, {x, 0, n}], x^n];
Flatten[Table[a[n, m], {n, 1, 9}, {m, 1, n}]][[1 ;; 38]]
(* Jean-François Alcover, Jun 21 2011, after e.g.f. *)
rows = 9;
t = Table[Product[5k+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) = n!*A049375(n, m)/(m!*5^(n-m)); a(n+1, m) = (5*n+m)*a(n, m)+ a(n, m-1), n >= m >= 1; a(n, m) := 0, n

a(n, m) = sum(|A051150(n, j)|*S2(j, m), j=m..n) (matrix product), with S2(j, m) := A008277(j, m) (Stirling2 triangle). Priv. comm. to 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.

A008546 Quintuple factorial numbers: Product_{k = 0..n-1} (5*k + 4).

Original entry on oeis.org

1, 4, 36, 504, 9576, 229824, 6664896, 226606464, 8837652096, 388856692224, 19053977918976, 1028914807624704, 60705973649857536, 3885182313590882304, 268077579637770878976, 19837740893195045044224, 1567181530562408558493696, 131643248567242318913470464

Offset: 0

Joe Keane (jgk(AT)jgk.org)

nonn

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.
Keiichi Shigechi, On the lattice of weighted partitions, arXiv:2212.14666 [math.CO], 2022. See p. 27.

Cf. A011801, A034301, A048994.

Cf. A008548, A047055, A047056, A051150, A052562, A254287.

List([0..20], n-> Product([0..n-1], k-> 5*k+4 )); # G. C. Greubel, Aug 20 2019

[1] cat [(&*[5*k+4: k in [0..n-1]]): n in [1..20]]; // G. C. Greubel, Aug 20 2019

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

FoldList[Times, 1, 5Range[0, 20] + 4] (* Vincenzo Librandi, Jun 10 2013 *)
CoefficientList[Series[(1 - 5x)^(-4/5), {x, 0, 20}], x] Range[0, 20]! (* Vaclav Kotesovec, Jan 28 2015 *)
Table[5^n Pochhammer[4/5, n], {n, 0, 20}] (* G. C. Greubel, Aug 20 2019 *)

vector(20, n, n--; prod(j=0,n-1, 5*j+4) ) \\ G. C. Greubel, Aug 20 2019

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

a(n) = 4*A034301(n) = (5*n - 1)(!^5), n >= 1, with a(0) = 1.
a(n) = A011801(n + 1, 1) (first column of triangle).
a(n) ~ (sqrt(2*Pi)/Gamma(4/5))*n^(n + 3/10)*(5/e)^n*(1 + 1/(300*n) + ...). - Joe Keane (jgk(AT)jgk.org), Nov 24 2001
G.f.: 1/(1 - 4*x/(1 - 5*x/(1 - 9*x/(1 - 10*x/(1 - 14*x/(1 - 15*x/(1 - 19*x/(1 - 20*x/(1 - 24*x/(1 - ... (continued fraction). - Philippe Deléham, Jan 08 2012
a(n) = (-1)^n*Sum_{k = 0..n} 5^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*(5*k - 1)/(1 - x*(5*k + 5)/Q(k + 1) ); (continued fraction); e.g.f. (1 - 5*x)^(-4/5). - Sergei N. Gladkovskii, Mar 20 2013
G.f.: 1/x - G(0)/(2*x), where G(k) = 1 + 1/(1 - x*(5*k - 1)/(x*(5*k - 1) + 1/G(k + 1))); (continued fraction). - Sergei N. Gladkovskii, May 27 2013
a(n) = 5^n * Gamma(n + 4/5) / Gamma(4/5). - Vaclav Kotesovec, Jan 28 2015
a(n) + (-5*n + 1)*a(n - 1) = 0. - R. J. Mathar, Sep 04 2016
G.f.: 1/(1 - 4*x - 20*x^2/(1 - 14*x - 90*x^2/(1 - 24*x - 210*x^2/(1 - 34*x - 380*x^2/(1 - 44*x - 600*x^2/(1 - 54*x - 870*x^2/(1 - ...))))))) (Jacobi continued fraction). - Nikolaos Pantelidis, Feb 29 2020
Sum_{n>=0} 1/a(n) = 1 + (e/5)^(1/5)*(Gamma(4/5) - Gamma(4/5, 1/5)). - Amiram Eldar, Dec 19 2022

A052562 a(n) = 5^n * n!.

Original entry on oeis.org

1, 5, 50, 750, 15000, 375000, 11250000, 393750000, 15750000000, 708750000000, 35437500000000, 1949062500000000, 116943750000000000, 7601343750000000000, 532094062500000000000, 39907054687500000000000

Offset: 0

Joe Keane (jgk(AT)jgk.org)

A simple regular expression in a labeled universe.

For n >= 1 a(n) is the order of the wreath product of the symmetric group S_n and the Abelian group (C_5)^n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 07 2001

Vincenzo Librandi, Table of n, a(n) for n = 0..300
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 504
Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.

Cf. A000142, A008548, A008546, A034325, A000165, A047055, A047056, A051150, A092514, A092618.

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

spec := [S,{S=Sequence(Union(Z,Z,Z,Z,Z))},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
with(combstruct):A:=[N,{N=Cycle(Union(Z$5))},labeled]: seq(count(A,size=n)/5,n=1..16); # Zerinvary Lajos, Dec 05 2007

Table[5^n*n!, {n, 0, 20}] (* Wesley Ivan Hurt, Sep 28 2013 *)

{a(n) = 5^n*n!}; \\ G. C. Greubel, May 05 2019

[5^n*factorial(n) for n in (0..20)] # G. C. Greubel, May 05 2019

a(n) = A051150(n+1, 0) (first column of triangle).
E.g.f.: 1/(1-5*x).
a(n) = 5*n*a(n-1) with a(0)=1.
G.f.: 1/(1-5*x/(1-5*x/(1-10*x/(1-10*x/(1-15*x/(1-15*x/(1-20*x/(1-... (continued fraction). - Philippe Deléham, Jan 08 2012
G.f.: 1/Q(0), where Q(k) = 1 - 5*x*(2*k+1) - 25*x^2*(k+1)^2/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, Sep 28 2013
a(n) = n!*A000351(n). - R. J. Mathar, Aug 21 2014
From Amiram Eldar, Jun 25 2020: (Start)
Sum_{n>=0} 1/a(n) = e^(1/5) (A092514).
Sum_{n>=0} (-1)^n/a(n) = e^(-1/5) (A092618). (End)

Name changed by Arkadiusz Wesolowski, Oct 04 2011

A051151 Generalized Stirling number triangle of first kind.

Original entry on oeis.org

1, -6, 1, 72, -18, 1, -1296, 396, -36, 1, 31104, -10800, 1260, -60, 1, -933120, 355104, -48600, 3060, -90, 1, 33592320, -13716864, 2104704, -158760, 6300, -126, 1, -1410877440, 609700608, -102114432, 8772624, -423360, 11592, -168

Offset: 1

Wolfdieter Lang

a(n,m) = R_n^m(a=0, b=6) in the notation of the given 1961 and 1962 references.
a(n,m) is a Jabotinsky matrix, i.e., the monic row polynomials E(n,x) := Sum_{m=1..n} a(n,m)*x^m = Product_{j=0..n-1} (x-6*j), n >= 1, and E(0,x) := 1 are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).
This is the signed Stirling1 triangle A008275 with diagonal d >= 0 (main diagonal d = 0) scaled with 6^d.

			Triangle a(n,m) (with rows n >= 1 and columns m = 1..n) begins:
        1;
       -6,      1;
       72,    -18,      1;
    -1296,    396,    -36,    1;
    31104, -10800,   1260,  -60,   1;
  -933120, 355104, -48600, 3060, -90, 1;
   ...
3rd row o.g.f.: E(3,x) = 72*x - 18*x^2 + x^3.

Wolfdieter Lang, First 10 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. [The numbers R_n^m(a,b) are first introduced.]
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. [Special cases of the numbers R_n^m(a,b) are tabulated.]

First (m=1) column sequence is: A047058(n-1).
Row sums (signed triangle): A008543(n-1)*(-1)^(n-1).
Row sums (unsigned triangle): A008542(n).
Cf. A008275 (Stirling1 triangle, b=1), A039683 (b=2), A051141 (b=3), A051142 (b=4), A051150 (b=5).

a(n, m) = a(n-1, m-1) - 6*(n-1)*a(n-1, m), n >= m >= 1; a(n, m) := 0, n < m; a(n, 0) := 0 for n >= 1; a(0, 0) = 1.
E.g.f. for the m-th column of the signed triangle: ((log(1 + 6*x)/6)^m)/m!.
a(n, m) = S1(n, m)*6^(n-m), with S1(n, m) := A008275(n, m) (signed Stirling1 triangle).

Various sections edited by Petros Hadjicostas, Jun 08 2020

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-7 of 7 results.

cp's OEIS Frontend

A008548 Quintuple factorial numbers: Product_{k=0..n-1} (5*k+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A008546 Quintuple factorial numbers: Product_{k = 0..n-1} (5*k + 4).

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A052562 a(n) = 5^n * n!.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A051151 Generalized Stirling number triangle of first kind.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A051186 Generalized Stirling number triangle of first kind.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Sage