545835

Appears in sequences

• Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n].at n=8A000670
• Nearest integer to n!/(2*log(2)^(n+1)).at n=8A034172
• Triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} defined by a(0,0)=1, a(n,0)=A000670(n), a(n,n)=A000629(n), a(n,k) = a(n,k-1) + a(n-1,k-1); a(n+1,0) = Sum_{k=0..n} a(n,k).at n=36A073146
• Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.at n=28A084416
• Triangle read by rows: T(n,k)=sum((n+1-i)!*stirling2(n,n+1-i),i=1..k), n>=1, 1<=k<=n.at n=35A084417
• Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.at n=28A088729
• Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).at n=35A094416
• Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=35A095705
• Triangular array read by rows: a(n, k) = number of ordered factorizations of a "hook-type" number with n total prime factors and k distinct prime factors. "Hook-type" means that only one prime can have multiplicity > 1.at n=35A098348
• T(n,k) = Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*A000670(n-k+i).at n=36A122101
• Triangle of numbers T(n,k) (n>=0, n>=k>=0) of transitive reflexive early confluent binary relations R on n labeled elements where k=max_{x}(|{y : xRy}|), read by rows.at n=44A135313
• Array read by antidiagonals of higher order Fubini numbers.at n=35A153278
• Triangle read by rows, T(n, k) = binomial(n, k) * Sum_{j=0..n-k} E(n-k, j)*2^j, where E(n, k) are the Eulerian numbers A173018(n, k), for 0 <= k <= n.at n=36A154921
• Triangle read by rows, A095989 convolved with A000670.at n=36A163204
• Triangle T(n,k), read by rows, given by (0, 1, 2, 2, 4, 3, 6, 4, 8, 5, 10, ...) DELTA (1, 0, 1, 0, 1, 0, 1, 0, ...) where DELTA is the operator defined in A084938.at n=46A184962
• Triangle of coefficients of a sequence of polynomials related to the enumeration of linear labeled rooted trees.at n=29A194649
• Number of transitive reflexive early confluent binary relations R on n labeled elements with max_{x}(|{y : xRy}|) = 8.at n=0A218098
• Triangle of F(n,r) of r-geometric numbers, 1 <= r <= n.at n=28A219374
• Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0).at n=44A226513
• Matrix inverse of triangle A227342.at n=36A227343