93391

Appears in sequences

• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as of [2, 3, 2].at n=11A211300
• a(n) = Sum_{d|n} binomial(d+n-1,n).at n=9A343548