Home Competitions CMO 2000 Problem 2
A sequence ( a n ) (a_n) ( a n ) is defined recursively by a 1 = 0 , a 2 = 1 a_1=0, a_2=1 a 1 = 0 , a 2 = 1 and for n ≥ 3 n\ge 3 n ≥ 3 ,
a n = 1 2 n a n − 1 + 1 2 n ( n − 1 ) a n − 2 + ( − 1 ) n ( 1 − n 2 ) . a_n=\frac12na_{n-1}+\frac12n(n-1)a_{n-2}+(-1)^n\left(1-\frac{n}{2}\right). a n = 2 1 n a n − 1 + 2 1 n ( n − 1 ) a n − 2 + ( − 1 ) n ( 1 − 2 n ) .
Find a closed-form expression for f n = a n + 2 ( n 1 ) a n − 1 + 3 ( n 2 ) a n − 2 + … + ( n − 1 ) ( n n − 2 ) a 2 + n ( n n − 1 ) a 1 f_n=a_n+2\binom{n}{1}a_{n-1}+3\binom{n}{2}a_{n-2}+\ldots +(n-1)\binom{n}{n-2}a_2+n\binom{n}{n-1}a_1 f n = a n + 2 ( 1 n ) a n − 1 + 3 ( 2 n ) a n − 2 + … + ( n − 1 ) ( n − 2 n ) a 2 + n ( n − 1 n ) a 1 .
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.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator cn-mo/2000/p2 · Tag EHFMPFAG6N · Edit this page on GitHub · Keys: j next, k previous