40839

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, 1, 2] as of [3, 1, 1].at n=10A211295
• Expansion of Product_{k>=1} (1 + x^k - x^(3*k)) / (1 - x^k).at n=28A266650