66904
domain: N
Appears in sequences
- Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=53A261836
- Number of compositions of n into distinct parts where each part i is marked with a word of length i over an octonary alphabet whose letters appear in alphabetical order and all letters occur at least once in the composition.at n=1A261859
- Number of ways to select a nonempty subset s from an n-set and then partition s into blocks of equal size.at n=11A262280