678569
domain: N
Appears in sequences
- a(n) = B(n) - 1, where B(n) = Bell numbers, A000110.at n=9A058692
- Number of primitive (aperiodic) word structures of length n using an infinite alphabet.at n=11A082951
- Number of ways of placing n labeled balls into 10 indistinguishable boxes; word structures of length n using a 10-ary alphabet.at n=11A164864
- a(n) is the number of palindromic structures using a maximum of ten different symbols.at n=21A164904
- a(n) is the number of palindromic structures using a maximum of ten different symbols.at n=22A164904
- Number of set partitions of {1, ..., n} that avoid enhanced 6-crossings (or enhanced 6-nestings).at n=11A192866
- The partition function G(n,10).at n=11A229227
- Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= nine.at n=11A287259
- Number of set partitions of [n] such that j is member of block b only if b = 1 or at least one of j-1, ..., j-8 is member of a block >= b-1.at n=11A287671
- a(n) = Sum_{k=1..n, gcd(n,k) = 1} Stirling2(n,k).at n=10A308463
- Number of set partitions of {1,...,n} with relatively prime block sizes.at n=11A318120
- a(n) = n! * [x^n] exp(Sum_{k=1..n, gcd(n,k) = 1} x^k / k!).at n=11A335797
- Number of 2-distant 5-noncrossing partitions of {1,...,n}.at n=11A366776