A039811 -id:A039811 - cp's OEIS frontend

A000258 Expansion of e.g.f. exp(exp(exp(x)-1)-1).

1, 1, 3, 12, 60, 358, 2471, 19302, 167894, 1606137, 16733779, 188378402, 2276423485, 29367807524, 402577243425, 5840190914957, 89345001017415, 1436904211547895, 24227076487779802, 427187837301557598, 7859930038606521508, 150601795280158255827

Offset: 0

N. J. A. Sloane

Number of 3-level labeled rooted trees with n leaves. - Christian G. Bower, Aug 15 1998
Number of pairs of set partitions (d,d') of [n] such that d is finer than d'. - A. Joseph Kennedy (kennedy_2001in(AT)yahoo.co.in), Feb 05 2006
In the Comm. Algebra paper cited, I introduce a sequence of algebras called 'class partition algebras' with this sequence as dimensions. The algebras are the centralizers of wreath product in combinatorial representation theory. - A. Joseph Kennedy (kennedy_2001in(AT)yahoo.co.in), Feb 17 2008
a(n) is the number of ways to partition {1,2,...,n} and then partition each cell (block) into subcells.

			G.f. = 1 + x + 3*x^2 + 12*x^3 + 60*x^4 + 358*x^5 + 2471*x^6 + 19302*x^7 + ...

J. Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353.
Ulrike Sattler, Decidable classes of formal power series with nice closure properties, Diplomarbeit im Fach Informatik, Univ. Erlangen - Nuernberg, Jul 27 1994
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.4.

Alois P. Heinz, Table of n, a(n) for n = 0..475 (first 101 terms from T. D. Noe)
A. Aboud, J.-P. Bultel, A. Chouria, J.-G. Luque, and O. Mallet, Bell polynomials in combinatorial Hopf algebras, arXiv preprint arXiv:1402.2960 [math.CO], 2014.
Francesca Aicardi, Diego Arcis, and Jesús Juyumaya, Brauer and Jones tied monoids, arXiv:2107.04170 [math.RT], 2021.
P. Blasiak, A. Horzela, K. A. Penson, G. H. E. Duchamp and A. I. Solomon, Boson normal ordering via substitutions and Sheffer-type polynomials, arXiv:quant-ph/0501155, 2005.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
P. J. Cameron, D. A. Gewurz and F. Merola, Product action, Discrete Math., 308 (2008), 386-394.
Jekuthiel Ginsburg, Iterated exponentials, Scripta Math., 11 (1945), 340-353. [Annotated scanned copy]
Gottfried Helms, Bell Numbers, 2008.
T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346.
T. Hogg and B. A. Huberman, Attractors on finite sets: the dissipative dynamics of computing structures, Phys. Review A 32 (1985), 2338-2346. (Annotated scanned copy)
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 70
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 292
A. Joseph Kennedy, Class partition algebras as centralizer algebras, Communications in Algebra, 35 (2007), 145-170, see page 153.
A. Joseph Kennedy, P. Jaish, and P. Sundaresan, Note on generating function of higher dimensional bell numbers (sic), Malaya Journal of Matematik (2020) Vol.8, No. 2, 369-372.
Marin Knežević, Vedran Krčadinac, and Lucija Relić, Matrix products of binomial coefficients and unsigned Stirling numbers, arXiv:2012.15307 [math.CO], 2020.
T. Mansour, A. Munagi, and M. Shattuck, Recurrence Relations and Two-Dimensional Set Partitions , J. Int. Seq. 14 (2011) #11.4.1.
K. A. Penson, P. Blasiak, G. Duchamp, A. Horzela and A. I. Solomon, Hierarchical Dobinski-type relations via substitution and the moment problem, arXiv:quant-ph/0312202, 2003, [J. Phys. A 37 (2004), 3475-3487].
John Riordan, Letter, Apr 28 1976.
N. J. A. Sloane and Thomas Wieder, The Number of Hierarchical Orderings, arXiv:math/0307064 [math.CO], 2003, [Order 21 (2004), 83-89].
Index entries for sequences related to rooted trees

Cf. A000110, A000307, A000357, A000405, A001669, A039811.
Row sums of (Stirling2)^2 triangle A130191.
Column k=2 of A144150.

m:=25; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(Exp(Exp(Exp(x)-1)-1))); [Factorial(n-1)*b[n]: n in [1..m]]; // Vincenzo Librandi, Feb 01 2020

with(combinat, bell, stirling2): seq(add(stirling2(n,k)*(bell(k)), k=0..n),n=0..30);
with(combstruct); SetSetSetL := [T, {T=Set(S), S=Set(U,card >= 1), U=Set(Z,card >=1)},labeled];
# alternative Maple program:
b:= proc(n, t) option remember; `if`(n=0 or t=0, 1, add(
       b(n-j, t)*b(j, t-1)*binomial(n-1, j-1), j=1..n))
    end:
a:= n-> b(n, 2):
seq(a(n), n=0..23);  # Alois P. Heinz, Sep 02 2021

nn = 20; Range[0, nn]! CoefficientList[Series[Exp[Exp[Exp[x] - 1] - 1], {x, 0, nn}], x]
a[ n_] := If[ n < 0, 0, n! SeriesCoefficient[ Exp[ Exp[ Exp[x] - 1] - 1] , {x, 0, n}]]; (* Michael Somos, Aug 15 2015 *)
a[n_] := Sum[StirlingS2[n, k]*BellB[k], {k, 0, n}]; Table[a[n], {n, 0, 25}] (* Jean-François Alcover, Feb 06 2016 *)
Table[Sum[BellY[n, k, BellB[Range[n]]], {k, 0, n}], {n, 0, 20}] (* Vladimir Reshetnikov, Nov 09 2016 *)

makelist(sum(stirling2(n,k)*belln(k),k,0,n),n,0,24); /* Emanuele Munarini, Jul 04 2011 */

a(n) = |A039811(n, 1)| (first column of triangle).
a(n) = Sum_{k=0..n} Stirling2(n, k)*Bell(k). - Detlef Pauly (dettodet(AT)yahoo.de), Jun 06 2002
Representation as an infinite series (Dobinski-type formula), in Maple notation: a(n)=exp(exp(-1)-1)*sum(evalf(sum(p!*stirling2(k, p)*exp(-p), p=1..k))*k^n/k!, k=0..infinity), n=1, 2, ... . - Karol A. Penson, Nov 28 2003
a(n) = Sum_{k=0..n} A055896(n,k). - R. J. Mathar, Apr 15 2008
G.f.: Sum_{j>=0} Bell(j)*x^j / Product_{k=1..j} (1 - k*x). - Ilya Gutkovskiy, Apr 06 2019

A039810 Matrix square of Stirling2 triangle A008277: 2-levels set partitions of [n] into k first-level subsets.

Original entry on oeis.org

1, 2, 1, 5, 6, 1, 15, 32, 12, 1, 52, 175, 110, 20, 1, 203, 1012, 945, 280, 30, 1, 877, 6230, 8092, 3465, 595, 42, 1, 4140, 40819, 70756, 40992, 10010, 1120, 56, 1, 21147, 283944, 638423, 479976, 156072, 24570, 1932, 72, 1, 115975, 2090424, 5971350, 5660615, 2350950, 487704, 53550, 3120, 90, 1

Offset: 1

Christian G. Bower, Feb 15 1999

This triangle groups certain generalized Stirling numbers of the second kind A000558, A000559, ... They can also be interpreted in terms of trees of height 3 with n leaves and constraints on the order of the root.
From Peter Bala, Jul 19 2014: (Start)
The (n,k)-th entry in this table gives the number of double partitions of the set [n] = {1,2,...,n} into k blocks. To form a double partition of [n] we first write [n] as a disjoint union X_1 U...U X_k of k nonempty subsets (blocks) X_i of [n]. Then each block X_i is further partitioned into sub-blocks to give a double partition. For instance, {1,2,4} U {3,5} is a partition of [5] into 2 blocks and {{1,4},{2}} U {{3},{5}} is a refinement of this partition to a double partition of [5] into 2 blocks (and 4 sub-blocks).
Compare the above interpretation for the (n,k)-th entry of this table with the interpretation of the (n,k)-th entry of A013609 (the square of Pascal's triangle but with the rows read in reverse order) as counting the pairs (X,Y) of subsets of [n] such that |Y| = k and X is contained in Y. (End)
Also the Bell transform of the shifted Bell numbers B(n+1) without column 0. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 28 2016
T(n,k) is the number of partitions of an n-set into colored blocks, such that exactly k colors are used and the colors are introduced in increasing order. T(3,2) = 6: 1a|23b, 13a|2b, 12a|3b, 1a|2a|3b, 1a|2b|3a, 1a|2b|3b. - Alois P. Heinz, Aug 27 2019

			Triangle begins:
      k = 1    2    3    4    5          sum
  n
  1       1                                1
  2       2    1                           3
  3       5    6    1                     12
  4      15   32   12    1                60
  5      52  175  110   20    1          358
Matrix multiplication Stirling2 * Stirling2:
                  1  0  0  0
                  1  1  0  0
                  1  3  1  0
                  1  7  6  1
.
  1  0  0  0      1  0  0  0
  1  1  0  0      2  1  0  0
  1  3  1  0      5  6  1  0
  1  7  6  1     15 32 12  1
From _Peter Bala_, Jul 19 2014: (Start)
T(5,2) = 175: A 5-set can be partitioned into 2 blocks as either a union of a 3-set and a 2-set or as a union of a 4-set and a singleton set.
In the first case there are 10 ways of partitioning a 5-set into a 3-set and a 2-set. Each 3-set can be further partitioned into sub-blocks in Bell(3) = 5 ways and each 2-set can be further partitioned into sub-blocks in Bell(2) = 2 ways. So altogether we obtain 10*5*2 = 100 double partitions of this type.
In the second case, there are 5 ways of partitioning a 5-set into a 4-set and a 1-set. Each 4-set can be further partitioned in Bell(4) = 15 ways and each 1-set can be further partitioned in Bell(1) = 1 way. So altogether we obtain 5*15*1 = 75 double partitions of this type.
Hence, in total, T(5,2) = 100 + 75 = 175. (End)

Tilman Piesk, First 100 rows, flattened
A. Aboud, J.-P. Bultel, A. Chouria, J.-G. Luque, and O. Mallet, Bell polynomials in combinatorial Hopf algebras, arXiv preprint arXiv:1402.2960 [math.CO], 2014-2015.
T. Mansour, A. Munagi, and M. Shattuck, Recurrence Relations and Two-Dimensional Set Partitions , J. Int. Seq. 14 (2011) # 11.4.1.

Cf. A039811, A039814, A039813 (other products of Stirling matrices).
T(n, 1) = A000110(n) (first column) (Bell numbers).
T(n, 2) = A000558(n) 2-levels set partitions with 2 first-level classes.
T(n, n-1) = A002378(n-1) = n*(n-1) = 2*C(n,2) = set-partitions into (n-2) singletons and one of the two possible set partitions of [2].
Sum is A000258(n), 2-levels set partitions.
Another version with offset 0: A130191.
Horizontal mirror triangle is A046817.
T(2n,n) gives A321712.

# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> combinat:-bell(n+1), 10); # Peter Luschny, Jan 28 2016

Flatten[Table[Sum[StirlingS2[n,i]*StirlingS2[i,k],{i,k,n}],{n,1,10},{k,1,n}]] (* Indranil Ghosh, Feb 22 2017 *)
rows = 10;
t = Table[BellB[n+1], {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 *)

T(n, k) = sum(j=0, n, stirling(n, j, 2)*stirling(j, k, 2)); \\ Seiichi Manyama, Feb 13 2022

S2 = A008277 (Stirling numbers of the second kind).
T = (S2)^2.
T(n,k) = Sum_{i=k..n} S2(n,i) * S2(i,k).
E.g.f. of k-th column: (exp(exp(x)-1)-1)^k/k!. [corrected by Seiichi Manyama, Feb 12 2022]
From Peter Bala, Jul 19 2014: (Start)
T(n,k) = Sum_{disjoint unions X_1 U...U X_k = [n]} Bell(|X_1|)*...*Bell(|X_k|), where Bell(n) = A000110(n).
Recurrence equation: T(n+1,k+1) = Sum_{j = k..n} Bell(n+1-j)*binomial(n,j)* T(j,k).
Row sums [1,3,12,60,358,...] = A000258. (End)

Definition and interpretation edited by Olivier Gérard, Jul 31 2011

A039813 Matrix 5th power of Stirling2 triangle A008277.

Original entry on oeis.org

1, 5, 1, 35, 15, 1, 315, 215, 30, 1, 3455, 3325, 725, 50, 1, 44590, 56605, 17100, 1825, 75, 1, 660665, 1060780, 415555, 60900, 3850, 105, 1, 11035095, 21772595, 10606470, 1998605, 172550, 7210, 140, 1, 204904830, 486459105, 286281665, 66528210, 7346955, 417690, 12390, 180, 1

Offset: 1

Christian G. Bower, Feb 15 1999

			Triangle begins:
      1;
      5,     1;
     35,    15,     1;
    315,   215,    30,    1;
   3455,  3325,   725,   50,  1;
  44590, 56605, 17100, 1825, 75, 1;
  ...

Seiichi Manyama, Rows n = 1..140, flattened

Cf. A008277, A000357 (first column).

Cf. A039810, A039811, A039812.

max = 9; m = MatrixPower[Array[StirlingS2, {max, max}], 5]; Table[Take[m[[n]], n], {n, 1, max}] // Flatten (* Jean-François Alcover, Mar 03 2014 *)

E.g.f. k-th column: (( exp(exp(exp(exp(exp(x)-1)-1)-1)-1)-1 )^k)/k!. [corrected by Seiichi Manyama, Feb 12 2022]

A039815 Triangle read by rows: matrix cube of the Stirling-1 triangle A008275.

Original entry on oeis.org

1, -3, 1, 15, -9, 1, -105, 87, -18, 1, 947, -975, 285, -30, 1, -10472, 12657, -4680, 705, -45, 1, 137337, -188090, 82887, -15960, 1470, -63, 1, -2085605, 3159699, -1598954, 370237, -43890, 2730, -84, 1, 36017472, -59326371, 33613353, -9009294, 1292067, -103950, 4662, -108, 1

Offset: 1

Christian G. Bower, Feb 15 1999

			Triangle begins:
       1;
      -3,     1;
      15,    -9,     1;
    -105,    87,   -18,   1;
     947,  -975,   285, -30,   1;
  -10472, 12657, -4680, 705, -45, 1;
  ...

Seiichi Manyama, Rows n = 1..140, flattened
Gabriella Bretti, Pierpaolo Natalini and Paolo E. Ricci, A new set of Sheffer-Bell polynomials and logarithmic numbers, Georgian Mathematical Journal, Feb. 2019, page 9.

Cf. A000268 (first column), A008275.

Cf. A039811, A039814, A039816, A039817.

T:= Matrix(10,10,(i,j) -> `if`(i>= j, combinat:-stirling1(i,j),0)):
M:= T^3:
seq(seq(M[i,j],j=1..i),i=1..10); # Robert Israel, Sep 12 2022

Flatten[Table[SeriesCoefficient[(Log[1+Log[1+Log[1+x]]])^k, {x,0,n}] n!/k!, {n,9}, {k,n}]] (* Stefano Spezia, Sep 12 2022 *)

E.g.f. of k-th column: ((log(1+log(1+log(1+x))))^k)/k!.

A039812 Triangle read by rows: matrix 4th power of the Stirling2 triangle A008277.

Original entry on oeis.org

1, 4, 1, 22, 12, 1, 154, 136, 24, 1, 1304, 1650, 460, 40, 1, 12915, 21904, 8550, 1160, 60, 1, 146115, 318521, 162904, 30590, 2450, 84, 1, 1855570, 5051988, 3246068, 789824, 86940, 4592, 112, 1, 26097835, 86910426, 68151304, 20606796, 2919504, 210924, 7896, 144, 1

Offset: 1

Christian G. Bower, Feb 15 1999

			Triangle begins
      1;
      4,     1;
     22,    12,    1;
    154,   136,   24,    1;
   1304,  1650,  460,   40,  1;
  12915, 21904, 8550, 1160, 60, 1;
  ...

Seiichi Manyama, Rows n = 1..140, flattened

Cf. A008277, A000307 (first column).

Cf. A039810, A039811, A039813.

Flatten[Table[SeriesCoefficient[(Exp[Exp[Exp[Exp[x]-1]-1]-1]-1)^k, {x,0,n}]  n!/k!, {n,9}, {k,n}]] (* Stefano Spezia, Sep 12 2022 *)

E.g.f. k-th column: (( exp(exp(exp(exp(x)-1)-1)-1)-1 )^k)/k!. [corrected by Seiichi Manyama, Feb 12 2022]

cp's OEIS Frontend

A000258 Expansion of e.g.f. exp(exp(exp(x)-1)-1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

Formula

A039810 Matrix square of Stirling2 triangle A008277: 2-levels set partitions of [n] into k first-level subsets.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A039813 Matrix 5th power of Stirling2 triangle A008277.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A039815 Triangle read by rows: matrix cube of the Stirling-1 triangle A008275.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A039812 Triangle read by rows: matrix 4th power of the Stirling2 triangle A008277.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A351513 Expansion of e.g.f. (exp(exp(exp(x)-1)-1)-1)^2 / 2.

Views

Author

Keywords

Crossrefs

Programs

PARI

PARI

Formula