115974

Appears in sequences

• a(n) = Sum_{d | n} mu(n/d) * Bell(d-1).at n=10A034743
• a(n) = B(n) - 1, where B(n) = Bell numbers, A000110.at n=8A058692
• Structured small rhombicubeoctahedral numbers.at n=26A100149
• Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = Sum_{i=1..k} Stirling2(n,i), 1<=k<=n.at n=53A102661
• A triangular array of numbers related to factorization and number of parts in Murasaki diagrams.at n=57A133611
• Triangle read by rows, A008277 * A000012.at n=46A137650
• Number of ways of placing n labeled balls into 9 indistinguishable boxes; word structures of length n using a 9-ary alphabet.at n=10A164863
• Permutation trees of power n and height k.at n=47A179454
• Number of set partitions of {1, ..., n} that avoid 5-nestings.at n=10A192126
• T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1.at n=53A211561
• The partition function G(n,9).at n=10A229226
• Triangle T(n,k) giving the number of terms of A219666 which have n digits (A084558) in their factorial base expansion and whose most significant digit (A099563) in that base is k.at n=54A230420
• Triangle A230420 transposed.at n=45A230421
• Number of primitive (aperiodic) palindromic structures of length n using an infinite alphabet.at n=18A284841
• Number of primitive (period n) periodic palindromic structures of length n using an infinite alphabet.at n=19A285042
• Number of set partitions of [n] such that all absolute differences between least elements of consecutive blocks are <= eight.at n=10A287258
• 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-7 is member of a block >= b-1.at n=10A287670
• Number of partitions of an n-set without blocks of size 10.at n=10A343671