110487

Appears in sequences

• Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-2)/2.at n=22A047184
• The (10^n)-th composite number.at n=5A065857
• Number of nondecreasing arrangements of n+3 numbers in 0..8 with each number being the sum mod 9 of three others.at n=8A183903
• Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=37A229422
• Triangle read by rows: T(n,k) is the number of maximal chains in the poset of all k-ary words of length <= n, ordered by B covers A iff A_i <= B_{i+k} for all i in A and some k >= 0.at n=40A378588