38325

Appears in sequences

• A(n,k,m) is the number of permutations of an n-set with k disjoint cycles of length less than or equal to m, called the (n,k)-th m-restrained Stirling numbers of the first kind, and denoted by mS_1(n,k). The sequence shows the case of m=3.at n=50A171996
• Triangle: T(n,k) equals the coefficient of x^n*y^k in the n-th iteration of x*(1+xy)/(1-x), for n>=1, 0<=k<n, as read by rows.at n=18A185755
• A diagonal of triangle A185755.at n=3A185759
• Numbers n with the property that if the base-8 representation of n is read backwards, the result is 5*n.at n=3A217742
• a(n) = binary code (shown here in decimal) of the position of natural number n in the beanstalk-tree A218778.at n=39A218614
• Numbers k with the property that if the base-8 representation of k is read backwards, the result is an integral multiple of k.at n=14A223090
• Number of length-4 0..n arrays with no repeated value greater than the previous repeated value.at n=12A269436
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the sum of distinct products Product_{j=1..k} b_j with 1 <= b_j<= n.at n=40A321163
• Sum of distinct products b_1*b_2*...*b_n where 1<=b_i<=n.at n=4A321164