102247563
domain: N
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=10A000670
- Number of dissimilarity relations on an n-set.at n=4A006541
- Nearest integer to n!/(2*log(2)^(n+1)).at n=10A034172
- Array read by antidiagonals of higher order Fubini numbers.at n=54A153278
- Number of transitive reflexive early confluent binary relations R on n labeled elements with max_{x}(|{y : xRy}|) = 10.at n=0A218091
- Triangle of F(n,r) of r-geometric numbers, 1 <= r <= n.at n=45A219374
- E.g.f.: Sum_{n>=0} exp(n^2*x) / 2^(n+1).at n=5A249938
- Number A(n,k) of ordered set partitions of {1,2,...,n} such that no part has the same size as any of its k immediate predecessors; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=65A261959
- Number of lattice paths from {n}^10 to {0}^10 using steps that decrement one or more components by one.at n=1A263070
- Triangle g(n,m) by rows: the number of m-compositions of Carlitz type of n without zero rows.at n=65A275080
- Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most ten elements.at n=10A276900
- Number of ordered set partitions of [n] with at most ten elements per block.at n=10A276930
- Square array A(n, k) read by descending antidiagonals, where column k is the expansion of the e.g.f. exp(k*x)/(2 - exp(x)).at n=65A292915
- Number of compositions of n where each part i is marked with a word of length i over a denary alphabet whose letters appear in alphabetical order and all ten letters occur at least once in the composition.at n=0A293587
- Number of achiral loops (necklaces or bracelets) of length n with integer entries that cover an initial interval of positive integers.at n=19A327868
- Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 - x^k/k! * (exp(x) - 1)).at n=65A355666
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (k*j)!* Stirling2(n,k*j).at n=76A357868