A238464 -id:A238464 - cp's OEIS frontend

A094416 Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).

1, 2, 3, 3, 10, 13, 4, 21, 74, 75, 5, 36, 219, 730, 541, 6, 55, 484, 3045, 9002, 4683, 7, 78, 905, 8676, 52923, 133210, 47293, 8, 105, 1518, 19855, 194404, 1103781, 2299754, 545835, 9, 136, 2359, 39390, 544505, 5227236, 26857659, 45375130, 7087261

Offset: 1

Ralf Stephan, May 02 2004

Also, r times the number of (r+1)-level labeled linear rooted trees with n leaves.
"AIJ" (ordered, indistinct, labeled) transform of {r,r,r,...}.
Stirling transform of r^n*n!, i.e. of e.g.f. 1/(1-r*x).
Also, Bo(r,s) is ((x*d/dx)^n)(1/(1+r-r*x)) evaluated at x=1.
r-th ordered Bell polynomial (A019538) evaluated at n.
Bo(r,n) is the n-th moment of a geometric distribution with probability parameter = 1/(r+1).  Here, geometric distribution is the number of failures prior to the first success. - Geoffrey Critzer, Jan 01 2019
Row r (starting at r=0), Bo(r+1, n), is the Akiyama-Tanigawa algorithm applied to the powers of r+1. See Python program below. - Shel Kaphan, May 03 2024

			Array begins as:
  1,  3,   13,    75,     541,     4683,      47293, ...
  2, 10,   74,   730,    9002,   133210,    2299754, ...
  3, 21,  219,  3045,   52923,  1103781,   26857659, ...
  4, 36,  484,  8676,  194404,  5227236,  163978084, ...
  5, 55,  905, 19855,  544505, 17919055,  687978905, ...
  6, 78, 1518, 39390, 1277646, 49729758, 2258233998, ...

G. C. Greubel, Antidiagonals n = 1..50, flattened
Paul Barry, Three Études on a sequence transformation pipeline, arXiv:1803.06408 [math.CO], 2018.
P. Blasiak, K. A. Penson and A. I. Solomon, Dobinski-type relations and the log-normal distribution, arXiv:quant-ph/0303030, 2003.
C. G. Bower, Transforms

Rows 1-10 are A000670, A004123, A032033, A094417, A094418, A094419, A238464, A238465, A238466, A238467.
Columns include A014105, A094421.
Main diagonal is A094420.
Antidiagonal sums are A094422.
Cf. A019538, A131689, A344499.

A094416:= func< n,k | (&+[Factorial(j)*n^j*StirlingSecond(k,j): j in [0..k]]) >;
[A094416(n-k+1,k): k in [1..n], n in [1..12]]; // G. C. Greubel, Jan 12 2024

Bo[, 0]=1; Bo[r, n_]:= Bo[r, n]= r*Sum[Binomial[n,k] Bo[r,n-k], {k, n}];
Table[Bo[r-n+1, n], {r, 10}, {n, r}] // Flatten (* Jean-François Alcover, Nov 03 2018 *)

# The Akiyama-Tanigawa algorithm applied to the powers of r + 1
# generates the rows. Adds one row (r=0) and one column (n=0).
# Adapted from Peter Luschny on A371568.
def f(n, r): return (r + 1)**n
def ATtransform(r, len, f):
  A = [0] * len
  R = [0] * len
  for n in range(len):
      R[n] = f(n, r)
      for j in range(n, 0, -1):
          R[j - 1] = j * (R[j] - R[j - 1])
      A[n] = R[0]
  return A
for r in range(8): print([r], ATtransform(r, 8, f)) # Shel Kaphan, May 03 2024

def A094416(n,k): return sum(factorial(j)*n^j*stirling_number2(k,j) for j in range(k+1)) # array
flatten([[A094416(n-k+1,k) for k in range(1,n+1)] for n in range(1,13)]) # G. C. Greubel, Jan 12 2024

E.g.f.: 1/(1 + r*(1 - exp(x))).
Bo(r, n) = Sum_{k=0..n} k!*r^k*Stirling2(n, k) = 1/(r+1) * Sum_{k>=1} k^n * (r/(r+1))^k, for r>0, n>0.
Recurrence: Bo(r, n) = r * Sum_{k=1..n} C(n, k)*Bo(r, n-k), with Bo(r, 0) = 1.
Bo(r,0) = 1, Bo(r,n) = r*Bo(r,n-1) - (r+1)*Sum_{j=1..n-1} (-1)^j * binomial(n-1,j) * Bo(r,n-j). - Seiichi Manyama, Nov 17 2023

Offset corrected by Geoffrey Critzer, Jan 01 2019

A345078 a(0) = 1; a(n) = 7 * Sum_{k=1..n} binomial(n,k) * a(k-1).

Original entry on oeis.org

1, 7, 63, 609, 6349, 70693, 835051, 10408335, 136290371, 1867933865, 26712000161, 397487932457, 6140285212915, 98264596199651, 1626101133819855, 27779382241071769, 489188555650420493, 8867962363328434205, 165284825277198034611, 3163858565498874214559, 62133992974174011252635

Offset: 0

Ilya Gutkovskiy, Jun 07 2021

nonn

Cf. A040027, A144263, A238464, A343523, A343975, A344735, A344840, A345077, A345081.

a[0] = 1; a[n_] := a[n] = 7 Sum[Binomial[n, k] a[k - 1], {k, 1, n}]; Table[a[n], {n, 0, 20}]
nmax = 20; A[] = 0; Do[A[x] = 1 + 7 x A[x/(1 - x)]/(1 - x)^2 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = 1 + 7 * x * A(x/(1 - x)) / (1 - x)^2.

A344499 T(n, k) = F(n - k, k), where F(n, x) is the Fubini polynomial. Triangle read by rows, T(n, k) for 0 <= k <= n.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 3, 2, 1, 0, 13, 10, 3, 1, 0, 75, 74, 21, 4, 1, 0, 541, 730, 219, 36, 5, 1, 0, 4683, 9002, 3045, 484, 55, 6, 1, 0, 47293, 133210, 52923, 8676, 905, 78, 7, 1, 0, 545835, 2299754, 1103781, 194404, 19855, 1518, 105, 8, 1, 0, 7087261, 45375130, 26857659, 5227236, 544505, 39390, 2359, 136, 9, 1

Offset: 0

Peter Luschny, May 21 2021

The array rows are recursively generated by applying the Akiyama-Tanigawa algorithm to the powers (see the Python implementation below). In this way the array becomes the image of A004248 under the AT-transformation when applied to the columns of A004248. This makes the array closely linked to A371761, which is generated in the same way, but applied to the rows of A004248. - Peter Luschny, Apr 27 2024

			Triangle starts:
[0] 1;
[1] 0, 1;
[2] 0, 1,      1;
[3] 0, 3,      2,       1;
[4] 0, 13,     10,      3,       1;
[5] 0, 75,     74,      21,      4,      1;
[6] 0, 541,    730,     219,     36,     5,     1;
[7] 0, 4683,   9002,    3045,    484,    55,    6,    1;
[8] 0, 47293,  133210,  52923,   8676,   905,   78,   7,   1;
[9] 0, 545835, 2299754, 1103781, 194404, 19855, 1518, 105, 8, 1;
.
Seen as an array A(n, k) = T(n + k, n):
[0] [1, 0,   0,    0,     0,       0,         0, ...  A000007
[1] [1, 1,   3,   13,    75,     541,      4683, ...  A000670
[2] [1, 2,  10,   74,   730,    9002,    133210, ...  A004123
[3] [1, 3,  21,  219,  3045,   52923,   1103781, ...  A032033
[4] [1, 4,  36,  484,  8676,  194404,   5227236, ...  A094417
[5] [1, 5,  55,  905, 19855,  544505,  17919055, ...  A094418
[6] [1, 6,  78, 1518, 39390, 1277646,  49729758, ...  A094419
[7] [1, 7, 105, 2359, 70665, 2646007, 118893705, ...  A238464

Variant of the array is A094416 (which has column 0 and row 0 missing).
The coefficients of the Fubini polynomials are A131689.
Cf. A094420 (main diagonal of array), A372346 (row sums), A004248, A371761.

F := proc(n) option remember; if n = 0 then return 1 fi:
expand(add(binomial(n, k)*F(n - k)*x, k = 1..n)) end:
seq(seq(subs(x = k, F(n - k)), k = 0..n), n = 0..10);

F[n_] := F[n] = If[n == 0, 1,
   Expand[Sum[Binomial[n, k]*F[n - k]*x, {k, 1, n}]]];
Table[Table[F[n - k] /. x -> k, {k, 0, n}], {n, 0, 10}] // Flatten (* Jean-François Alcover, Jun 06 2024, after Peter Luschny *)

# Computes the triangle.
@cached_function
def F(n):
    R. = PolynomialRing(ZZ)
    if n == 0: return R(1)
    return R(sum(binomial(n, k)*F(n - k)*x for k in (1..n)))
def Fval(n): return [F(n - k).substitute(x = k) for k in (0..n)]
for n in range(10): print(Fval(n))

# Computes the square array using the Akiyama-Tanigawa algorithm.
def ATFubini(n, len):
    A = [0] * len
    R = [0] * len
    for k in range(len):
        R[k] = (n + 1)**k  # Chancing this to R[k] = k**n generates A371761.
        for j in range(k, 0, -1):
            R[j - 1] = j * (R[j] - R[j - 1])
        A[k] = R[0]
    return A
for n in range(8): print([n], ATFubini(n, 7))  # Peter Luschny, Apr 27 2024

T(n, k) = (n - k)! * [x^(n - k)] (1 / (1 + k * (1 - exp(x)))).

T(2*n, n) = A094420(n).

A238465 Generalized ordered Bell numbers Bo(8,n).

Original entry on oeis.org

1, 8, 136, 3464, 117640, 4993928, 254396296, 15119104904, 1026912225160, 78468091562888, 6662087721342856, 622186077361470344, 63389713864392140680, 6996476832548305415048, 831619554631233264449416, 105909083171031626820475784

Offset: 0

Vincenzo Librandi, Mar 18 2014

nonn

Row 8 of array A094416, which has more information.

Vincenzo Librandi, Table of n, a(n) for n = 0..250

Cf. A000670, A004123, A032033, A094417, A094418, A094419, A238464.

m:=20; R:=LaurentSeriesRing(RationalField(), m); b:=Coefficients(R!(1/(9 - 8*Exp(x)))); [Factorial(n-1)*b[n]: n in [1..m]];

t = 30; Range[0, t]! CoefficientList[Series[1/(9 - 8 Exp[x]), {x, 0, t}], x]

E.g.f.: 1/(9 - 8*exp(x)).
a(n) ~ n! / (9*(log(9/8))^(n+1)). - Vaclav Kotesovec, Mar 20 2014
a(0) = 1; a(n) = 8*a(n-1) - 9*Sum_{k=1..n-1} (-1)^k * binomial(n-1,k) * a(n-k). - Seiichi Manyama, Nov 17 2023

A238466 Generalized ordered Bell numbers Bo(9,n).

Original entry on oeis.org

1, 9, 171, 4869, 184851, 8772309, 499559571, 33190014069, 2520110222451, 215270320769109, 20431783142389971, 2133148392099721269, 242954208655633344051, 29977118969127060357909, 3983272698956314883956371, 567091857051921058649396469

Offset: 0

Vincenzo Librandi, Mar 18 2014

nonn

Row 9 of array A094416, which has more information.

Vincenzo Librandi, Table of n, a(n) for n = 0..250

Cf. A000670, A004123, A032033, A094417, A094418, A094419, A238464.

m:=20; R:=LaurentSeriesRing(RationalField(), m); b:=Coefficients(R!(1/(10 - 9*Exp(x)))); [Factorial(n-1)*b[n]: n in [1..m]];

t=30; Range[0, t]! CoefficientList[Series[1/(10 - 9 Exp[x]), {x, 0, t}], x]

E.g.f.: 1/(10 - 9*exp(x)).
a(n) ~ n! / (10*(log(10/9))^(n+1)). - Vaclav Kotesovec, Mar 20 2014
a(0) = 1; a(n) = 9*a(n-1) - 10*Sum_{k=1..n-1} (-1)^k * binomial(n-1,k) * a(n-k). - Seiichi Manyama, Nov 17 2023

A238467 Generalized ordered Bell numbers Bo(10,n).

Original entry on oeis.org

1, 10, 210, 6610, 277410, 14553010, 916146210, 67285818610, 5647734061410, 533307215001010, 55954905981282210, 6457903731351210610, 813080459351919805410, 110901542660769629769010, 16290196917457939734258210

Offset: 0

Vincenzo Librandi, Mar 18 2014

nonn

Row 10 of array A094416, which has more information.

Vincenzo Librandi, Table of n, a(n) for n = 0..250

Cf. A000670, A004123, A032033, A094417, A094418, A094419, A238464.

m:=20; R:=LaurentSeriesRing(RationalField(), m); b:=Coefficients(R!(1/(11 - 10*Exp(x)))); [Factorial(n-1)*b[n]: n in [1..m]];

t=30; Range[0, t]! CoefficientList[Series[1/(11 - 10 Exp[x]), {x, 0, t}], x]

E.g.f.: 1/(11 - 10*exp(x)).
a(n) ~ n! / (11*(log(11/10))^(n+1)). - Vaclav Kotesovec, Mar 20 2014
a(0) = 1; a(n) = 10*a(n-1) - 11*Sum_{k=1..n-1} (-1)^k * binomial(n-1,k) * a(n-k). - Seiichi Manyama, Nov 17 2023

cp's OEIS Frontend

A094416 Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Python

SageMath

Formula

Extensions

A345078 a(0) = 1; a(n) = 7 * Sum_{k=1..n} binomial(n,k) * a(k-1).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A344499 T(n, k) = F(n - k, k), where F(n, x) is the Fubini polynomial. Triangle read by rows, T(n, k) for 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

SageMath

SageMath

Formula

A238465 Generalized ordered Bell numbers Bo(8,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A238466 Generalized ordered Bell numbers Bo(9,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A238467 Generalized ordered Bell numbers Bo(10,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Formula