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!)
A051187 Generalized Stirling number triangle of the first kind. 5
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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)
LINKS
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.
FORMULA
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)
EXAMPLE
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.
CROSSREFS
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.
Sequence in context: A048786 A240955 A132056 * A284865 A221758 A322699
KEYWORD
sign,easy,tabl
AUTHOR
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)