53343360
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=33A101819
- 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=26A101821
- Triangle read by rows, T(n,k) = RF(n-k+1, n-k) * S1(n,k) where RF denotes the rising factorial and S1 the Stirling cycle numbers, for n>=0 and 0<=k<=n.at n=30A268436
- Triangle read by rows: T(n,k) (n>=1, 4<=k<=n+3) is the number of k-sequences of balls colored with at most n colors such that exactly three balls are of a color seen previously in the sequence.at n=33A292879