41541

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 [2, 1, 1].at n=10A211292
• Matchings avoiding the pattern 132.at n=7A220911
• Number of partitions of n whose minimal excluded multiplicity is odd.at n=45A300183
• Numbers k such that A109812(k) AND A109812(k+2) = 0 (where AND denotes the bitwise AND operator).at n=35A352773