38894

Appears in sequences

• Number of digits in the decimal expansion of the Champernowne constant that must be scanned to encounter all n-digit strings.at n=4A072290
• Number of partitions of n in which any two parts differ by at most 8.at n=48A218510
• Number of permutations of [n] having a shortest ascending run of length 7.at n=10A228674
• Number T(n,k) of permutations of [n] where the minimal cyclic distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=37A277031
• Number of permutations of [n] such that the minimal cyclic distance between elements of the same cycle equals one, a(1)=1 by convention.at n=7A277032
• Number of 5 X n 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A281209
• Number of integer compositions of n whose leaders of weakly increasing runs are strictly increasing.at n=26A374634