678570

Appears in sequences

• Bell or exponential numbers: number of ways to partition a set of n labeled elements.at n=11A000110
• M-sequences m_0,...,m_9 with m_1 < n.at n=3A011825
• Smallest Bell number divisible by n not included earlier, or 0 if no such number exists.at n=9A073877
• Number of partitions of an n-element set that have at least one odd block.at n=10A089004
• Bisection of Bell numbers, A000110.at n=5A099977
• a(n) = Bell(3*n+2).at n=3A121293
• Triangle T(n,k), n>=1, 1<=k<=n, read by rows, where sequence a_k of column k has a_k(0)=1, followed by (k-1)-fold 0 and a_k(n) shifts k places down under binomial transform.at n=55A143983
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k).at n=77A145460
• Triangle read by rows, truncated columns of an array formed by taking sets of P(n) = Pascal's triangle, with the 1's column shifted up n = 1,2,3,... times. Then the n-th row of the array = lim_{k->infinity}, k=1,2,3,...; (P(n))^k, deleting the first 1.at n=65A171840
• Triangle, A000110 in every column > 0, shifted down twice.at n=36A173108
• Triangle, A000110 in every column > 0, shifted down twice.at n=50A173108
• Triangle read by rows, A173108 * the diagonalized variant of A173110.at n=36A173111
• Generalized Bell numbers; square array read by ascending antidiagonals, A(n, k) for n >= 0 and k >= 1.at n=66A182931
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing cycles (0<=k<=floor(n/3)). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=26A186756
• Number of palindromic structures of length n.at n=21A188164
• Number of palindromic structures of length n.at n=22A188164
• Number of set partitions of {1, ..., n} that avoid 6-nestings.at n=11A192127
• Number of set partitions of {1, ..., n} that avoid 7-nestings.at n=11A192128
• Number of set partitions of {1, ..., n} that avoid enhanced 7-crossings (or enhanced 7-nestings).at n=11A192867
• Number of arrays of n 0..10 integers with new values introduced in order 0..10 but otherwise unconstrained.at n=10A203641