7087261

Properties

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=9A000670
• Nearest integer to n!/(2*log(2)^(n+1)).at n=9A034172
• a(n) = Bo(n^2), n=0,1..., where Bo(n) are the ordered Bell numbers, A000670.at n=3A068942
• Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.at n=36A084416
• Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.at n=36A088729
• Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).at n=44A094416
• 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=44A095705
• "Stirling-Bernoulli transform" of Jacobsthal numbers.at n=9A105796
• 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=54A135313
• Array read by antidiagonals of higher order Fubini numbers.at n=44A153278
• 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=45A154921
• Triangle read by rows, A095989 convolved with A000670.at n=45A163204
• Triangle of coefficients of a sequence of polynomials related to the enumeration of linear labeled rooted trees.at n=37A194649
• Number of transitive reflexive early confluent binary relations R on n labeled elements with max_{x}(|{y : xRy}|) = 9.at n=0A218099
• Triangle of F(n,r) of r-geometric numbers, 1 <= r <= n.at n=36A219374
• Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0).at n=54A226513
• Matrix inverse of triangle A227342.at n=45A227343
• Matrix inverse of triangle A227342.at n=46A227343
• T(n,k) = Stirling2(n,k) * OrderedBell(k).at n=44A232598
• Number T(n,k) of endofunctions on [n] such that at least one preimage with cardinality >=k exists and a nonempty preimage of j implies that all i<=j have preimages with cardinality >=k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A245732