351103

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, 1, 2].at n=12A211298
• Number of (w,x,y,z) with all terms in {1,...,n} and w >= (geometric mean of x,y,z).at n=28A212142