1941390

Appears in sequences

• a(n) = binomial(2*c-1, c-1) (mod c^4), where c is the n-th composite number.at n=31A298946
• Number of words w of length n such that each letter of the septenary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=4A321843