NL-NWO 2012 Problem 5
The numbers to are arranged in a sequence. The number of ways this can be done equals . We impose the condition that in the sequence there should be exactly one number that is smaller than the number directly preceding it. How many of the sequences satisfy this condition?
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.