25221

Appears in sequences

• a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digits 1,2,3,4 and 5, at least one of digits 6,7 and at least one of digits 8,9.at n=7A126645
• Number of ways of partitioning the multiset {1,1,2,3,...,n-1} into exactly five nonempty parts.at n=5A168585
• (A192377)/2.at n=9A192378
• Number of (w,x,y,z) with all terms in {1,...,n} and 2*w*x>3*y*z.at n=16A211922
• Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n.at n=49A241500
• Number of length n+5+1 0..5 arrays with every value 0..5 appearing at least once in every consecutive 5+2 elements, and new values 0..5 introduced in order.at n=10A242236