3217059631

Appears in sequences

• Number of words of length n over an infinite alphabet such that all prefixes satisfy c(3*k + 1) >= c(3*k + 2), c(3*k + 1) >= c(3*k), c(3*k + 2) >= c(3*j + 1), and c(3*k) >= c(3*j + 1) for 0 <= k < j, where c(i) is the number of occurrences of the letter i.at n=17A392551