VTRMC 2006 Problem 2
Let denote the number of sequences of length formed by the three letters with the restriction that the 's (if any) all occur in a single block immediately following the first (if any). For example , , and are counted in, but and are not. Derive a simple formula for and use it to calculate .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.