A051187 -id:A051187 - cp's OEIS frontend

A045755 8-fold factorials: a(n) = Product_{k=0..n-1} (8*k+1).

1, 1, 9, 153, 3825, 126225, 5175225, 253586025, 14454403425, 939536222625, 68586144251625, 5555477684381625, 494437513909964625, 47960438849266568625, 5035846079172989705625, 569050606946547836735625, 68855123440532288245010625, 8882310923828665183606370625

Offset: 0

Wolfdieter Lang

nonn

G. C. Greubel, Table of n, a(n) for n = 0..330

Cf. k-fold factorials : A000142, A001147, A007559, A007696, A008548, A008542, A045754.

Cf. A048994, A051187, A113135.

List([0..20], n-> Product([0..n-1], j-> 8*j+1) ); # G. C. Greubel, Nov 11 2019

[1] cat [(&*[8*j+1: j in [0..n-1]]): n in [1..20]]; // G. C. Greubel, Nov 11 2019

Maple
```
a := n->product(8*k+1), k=0..(n-1));
```

Table[8^n*Pochhammer[1/8, n], {n,0,20}] (* G. C. Greubel, Nov 11 2019 *)

PARI
```
a(n)=prod(k=0, n, 8*k+1);
```

[product( (8*j+1) for j in (0..n-1)) for n in (0..20)] # G. C. Greubel, Nov 11 2019

a(n+1) = (8*n+1)(!^8).
a(n) = Sum_{k=0..n} (-8)^(n-k)*A048994(n, k); A048994 = Stirling-1 numbers.
E.g.f.: (1-8*x)^(-1/8).
G.f.: 1+x/(1-9x/(1-8x/(1-17x/(1-16x/(1-25x/(1-24x/(1-33x/(1-32x/(1-... (continued fraction). - Philippe Deléham, Jan 07 2012
a(n) = (-7)^n*Sum_{k=0..n} (8/7)^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*(8*k+1)/(1 - x*(8*k+8)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Mar 20 2013
G.f.: 2/G(0), where G(k)= 1 + 1/(1 - 2*x*(8*k+1)/(2*x*(8*k+1) - 1 + 16*x*(k+1)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 30 2013
G.f.: G(0)/2, where G(k)= 1 + 1/(1 - x*(8*k+1)/(x*(8*k+1) + 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 05 2013
a(n) = 8^n * Gamma(n + 1/8) / Gamma(1/8). - Artur Jasinski,Aug 23 2016
a(n) ~ sqrt(2*Pi) * 8^n * n^(n - 3/8)/(Gamma(1/8)*exp(n)). - Ilya Gutkovskiy, Sep 10 2016
D-finite with recurrence: a(n) +(-8*n+7)*a(n-1)=0. - R. J. Mathar, Jan 17 2020
Sum_{n>=0} 1/a(n) = 1 + (e/8^7)^(1/8)*(Gamma(1/8) - Gamma(1/8, 1/8)). - Amiram Eldar, Dec 20 2022

Additional comments from Philippe Deléham and Paul D. Hanna, Oct 29 2005

Edited by N. J. A. Sloane, Oct 14 2008 at the suggestion of Artur Jasinski.

A051189 Octo-factorial numbers.

Original entry on oeis.org

1, 8, 128, 3072, 98304, 3932160, 188743680, 10569646080, 676457349120, 48704929136640, 3896394330931200, 342882701121945600, 32916739307706777600, 3423340888001504870400, 383414179456168545484800

Offset: 0

Wolfdieter Lang

For n >= 1, a(n) is the order of the wreath product of the symmetric group S_n and the Abelian group (C_8)^n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 07 2001
Number of n X n monomial matrices whose nonzero entries are unit quaternions.
Number of ways of reassembling n slices of toast or of binding n square pages. - Donald S. McDonald, Sep 24 2005

Vincenzo Librandi, Table of n, a(n) for n = 0..300
Index entries for sequences related to factorial numbers

Cf. A000165, A034976, A047058, A051188, A053115.

Shifted absolute values are column 1 of A051187.

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

Table[n! 8^n,{n,0,20}] (* Harvey P. Dale, Aug 14 2021 *)

[8^n*factorial(n) for n in range(40)] # G. C. Greubel, Oct 21 2022

a(n) = 8*A034976(n) = Product_{k=1..n} 8*k, n >= 1; a(0) = 1.
a(n) = n!*8^n.
E.g.f.: 1/(1-8*x).
G.f.: 1/(1 - 8*x/(1 - 8*x/(1 - 16*x/(1 - 16*x/(1 - 24*x/(1 - 24*x/(1 - 32*x/(1 - 32*x/(1 - ... (continued fraction). - Philippe Deléham, Jan 07 2012
From Amiram Eldar, Jun 25 2020: (Start)
Sum_{n>=0} 1/a(n) = e^(1/8).
Sum_{n>=0} (-1)^n/a(n) = e^(-1/8). (End)

A049210 a(n) = -Product_{k=0..n} (8*k-1); octo-factorial numbers.

Original entry on oeis.org

1, 7, 105, 2415, 74865, 2919735, 137227545, 7547514975, 475493443425, 33760034483175, 2667042724170825, 232032717002861775, 22043108115271868625, 2270440135873002468375, 252018855081903273989625, 29990243754746489604765375, 3808760956852804179805202625

Offset: 0

Wolfdieter Lang

Seiichi Manyama, Table of n, a(n) for n = 0..333
Index entries for sequences related to factorial numbers.

Cf. A034975, A048994, A051187.

Sequences of the form m^n*Pochhammer((m-1)/m, n): A000007 (m=1), A001147 (m=2), A008544 (m=3), A008545 (m=4), A008546 (m=5), A008543 (m=6), A049209 (m=7), this sequence (m=8), A049211 (m=9), A049212 (m=10), A254322 (m=11), A346896 (m=12).

m:=8; [Round(m^n*Gamma(n +(m-1)/m)/Gamma((m-1)/m)): n in [0..30]]; // G. C. Greubel, Feb 16 2022

FoldList[Times,1,8*Range[20]-1] (* Harvey P. Dale, Aug 03 2014 *)
CoefficientList[Series[(1-8*x)^(-7/8),{x,0,20}],x] * Range[0,20]! (* Vaclav Kotesovec, Jan 28 2015 *)

a(n) = -prod(k=0, n, 8*k-1); \\ Michel Marcus, Jan 08 2015

m=8; [m^n*rising_factorial((m-1)/m, n) for n in (0..30)] # G. C. Greubel, Feb 16 2022

a(n) = 7*A034975(n) = (8*n-1)(!^8), n >= 1, a(0) = 1.
G.f.: 1/(1-7*x/(1-8*x/(1-15*x/(1-16*x/(1-23*x/(1-24*x/(1-31*x/(1-32*x/(1-... (continued fraction). - Philippe Deléham, Jan 07 2012
a(n) = (-1)^n*Sum_{k=0..n} 8^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*(8*k-1)/(1 - x*(8*k+8)/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Mar 20 2013
a(n) = 8^n*Gamma(n+7/8)/Gamma(7/8). - R. J. Mathar, Mar 20 2013
E.g.f: (1-8*x)^(-7/8). - Vaclav Kotesovec, Jan 28 2015
G.f.: 1/(1-7*x-56*x^2/(1-23*x-240*x^2/(1-39*x-552*x^2/(1-55*x-992*x^2/(1-71*x-1560*x^2/(1-... )))))) (Jacobi continued fraction). - Nikolaos Pantelidis, Dec 09 2020
G.f.: 1/G(0) where G(k) = 1 - (16*k+7)*x - 8*(k+1)*(8*k+7)*x^2/G(k+1); (continued fraction). - Nikolaos Pantelidis, Dec 19 2020
Sum_{n>=0} 1/a(n) = 1 + (e/8)^(1/8)*(Gamma(7/8) - Gamma(7/8, 1/8)). - Amiram Eldar, Dec 20 2022

A048176 Generalized Stirling number triangle of first kind.

Original entry on oeis.org

1, -10, 1, 200, -30, 1, -6000, 1100, -60, 1, 240000, -50000, 3500, -100, 1, -12000000, 2740000, -225000, 8500, -150, 1, 720000000, -176400000, 16240000, -735000, 17500, -210, 1, -50400000000, 13068000000, -1313200000, 67690000, -1960000, 32200, -280, 1, 4032000000000, -1095840000000

Offset: 1

Wolfdieter Lang

a(n,m)= R_n^m(a=0,b=10) in the notation of the given reference.
a(n,m) is a Jabotinsky matrix, i.e., the monic row polynomials E(n,x) := sum(a(n,m)*x^m,m=1..n) = product(x-10*j,j=0..n-1), n >= 1, E(0,x) := 1, are exponential convolution polynomials (see A039692 for the definition and a Knuth reference).
Also the Bell transform of the sequence (-1)^n*A051262(n) without column 0. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 28 2016

			{1}; {-10,1}; {200,-30,1}; {-6000,1100,-60,1}; ... E(3,x) = 200*x-30*x^2+x^3.

Mitrinovic, D. S.; Mitrinovic, R. S.; Tableaux d'une classe de nombres relies aux nombres de Stirling. Univ. Beograd. Pubi. Elektrotehn. Fak. Ser. Mat. Fiz. No. 77 1962, 77 pp.

First (m=1) (unsigned) column sequence is: A051262(n-1). Row sums (signed triangle): A049212(n-1)*(-1)^(n-1). Row sums (unsigned triangle): A045757(n). b=8: A051187, b=9: A051231.

# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> (-1)^n*n!*10^n, 9); # Peter Luschny, Jan 28 2016

rows = 9;
t = Table[(-1)^n*n!*10^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) = a(n-1, m-1) - 10*(n-1)*a(n-1, m), n >= m >= 1; a(n, m) := 0, n

A051231 Generalized Stirling number triangle of the first kind.

Original entry on oeis.org

1, -9, 1, 162, -27, 1, -4374, 891, -54, 1, 157464, -36450, 2835, -90, 1, -7085880, 1797714, -164025, 6885, -135, 1, 382637520, -104162436, 10655064, -535815, 14175, -189, 1, -24106163760, 6944870988, -775431468, 44411409, -1428840, 26082, -252, 1

Offset: 1

Wolfdieter Lang

T(n,m) = R_n^m(a=0, b=9) 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 - 9*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 06 2020: (Start)
For nonnegative integers n, m and complex numbers a, b (with b <> 0), the numbers R_n^m(a,b) were introduced by Mitrinovic (1961) using slightly different notation. They were further examined by Mitrinovic and Mitrinovic (1962). Special cases were tabulated in this and other related papers.
Special cases of these numbers are related to numbers introduced by Nörlund (1924).
These numbers are defined via the g.f. 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, and R_n^m(a,b) = 0 for n < m. (Because an empty product is by definition 1, we may let 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) which satisfy Product_{r=0}^{n-1} (x - r) = Sum_{m=0..n} S1(n,m)*x^m with S1(n,n) = 1 for n >= 0, S1(n,0) = 0 for n >= 1, and S1(n, m) = 0 for m > n. (Array A008275 is the same as array A048994 but with no zero row and no zero column.)
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=9) but with no zero row or column. (End)

			Triangle T(n,m) (with rows n >= 1 and columns m = 1..n) begins:
         1;
        -9,       1;
       162,     -27,       1;
     -4374,     891,     -54,    1;
    157464,  -36450,    2835,  -90,    1;
  -7085880, 1797714, -164025, 6885, -135, 1;
   ...
3rd row o.g.f.: E(3,x) = Product_{j=0..2} (x-9*j) = 162*x - 27*x^2 + x^3. [Edited by _Petros Hadjicostas_, Jun 06 2020]

D. S. Mitrinovic, Sur une relation de récurrence relative aux nombres de Bernoulli, Comptes rendus de l'Académie des sciences de Paris, t. 250 (1960), 4266-4267.
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érieux, 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].
D. S. Mitrinovic and R. S. Mitrinovic, Tableaux d'une classe de nombres reliés aux nombres de Stirling. V, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz., No. 132/142 (1965), 1-22.
Niels Nörlund, Vorlesungen über Differenzenrechnung, Springer, Berlin, 1924.
Wikipedia, Dragoslav Mitrinovic.

First (m=1) column sequence is A051232(n-1).
Row sums (signed triangle): A049211(n-1)*(-1)^(n-1).
Row sums (unsigned triangle): A045756(n).
Cf. A008275 (b=1 triangle), A048994 (b=1 triangle), A051187 (b=8 triangle).

T(n, m) = T(n-1, m-1) - 9*(n-1)*T(n-1, m), n >= m >= 1; T(n, m) := 0, 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 + 9*x)/9)^m/m!.
From Petros Hadjicostas, Jun 07 2020: (Start)
T(n,m) = 9^(n-m)*Stirling1(n,m) = 9^(n-m)*A048994(n,m) = 9^(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/9)*log(1 + 9*x)) - 1 = (1 + 9*x)^(y/9) - 1. (End)

Showing 1-5 of 5 results.

cp's OEIS Frontend

A045755 8-fold factorials: a(n) = Product_{k=0..n-1} (8*k+1).

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A051189 Octo-factorial numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A049210 a(n) = -Product_{k=0..n} (8*k-1); octo-factorial numbers.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A048176 Generalized Stirling number triangle of first kind.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Maple

Mathematica

Formula

A051231 Generalized Stirling number triangle of the first kind.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula