47293

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=7A000670
• Nearest integer to n!/(2*log(2)^(n+1)).at n=7A034172
• Numbers having four 7's in base 9.at n=8A043484
• Fifth term of strong prime sextets: p(m-3)-p(m-4) > p(m-2)-p(m-3) > p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m).at n=15A054817
• 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=28A073146
• Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.at n=21A084416
• 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=27A084417
• Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.at n=21A088729
• Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).at n=27A094416
• 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=27A095705
• 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=27A098348
• "Stirling-Bernoulli transform" of Jacobsthal numbers.at n=7A105796
• Triangle T(n,k), 0<=k<=n, read by rows, given by [1, 2, 2, 4, 3, 6, 4, 8, 5, 10, 6, 12, . . . ] DELTA [2, 1, 4, 2, 6, 3, 8, 4, 10, 5, 12, 6, . . . ] where DELTA is the operator defined in A084938.at n=28A108694
• Numbers whose square root in base 10 starts with 10 distinct digits.at n=24A113507
• T(n,k) = Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*A000670(n-k+i).at n=28A122101
• A tabular sequence of arrays counting ordered factorizations over least prime signatures. The unordered version is described by sequence A129306.at n=35A131420
• 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=35A135313
• Array read by antidiagonals of higher order Fubini numbers.at n=27A153278
• 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=28A154921
• Triangle read by rows, A095989 convolved with A000670.at n=28A163204