1340640
domain: N
Appears in sequences
- Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-1} such that |Image(f)|=h, h=1,2,...,n-1, n=2,3,...at n=26A101819
- Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-2} such that |Image(f)|=h, h=1,2,...,n-2; n=3,4,....at n=20A101821
- Triangle read by rows: T(n,k) (n>=1, 3<=k<=n+2) is the number of k-sequences of balls colored with n colors such that exactly two balls are of a color seen previously in the sequence.at n=26A281944
- Number of sets of nonempty words with a total of n letters over quaternary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=14A293743
- Triangle read by rows: T(n,m) (1<=m<=n) = number of surjections f:[n]->[m] with f(n) != f(j), j<n.at n=42A380977