122770
domain: N
Appears in sequences
- Sum of distances between greatest-part-order and length-order of partitions of n.at n=20A036051
- Triangle, read by rows, where the g.f. of column k, C_k(x), is defined by the recursion: C_k(x) = ( 1 + Sum_{n>=1} x^n*C_{n-1+k}(x) )^(k+1).at n=48A127082
- Column 3 of triangle A127082.at n=6A127086
- Number of n X n 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.at n=4A267782
- Number of nX5 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.at n=4A267785
- T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.at n=40A267788
- Number of 5Xn 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.at n=4A267791