olymmath

ÖMO 2000 Problem 1

    The sequence an is defined by a0=4,a1=1a_0 = 4, a_1 = 1 and the recurrence formula an+1=an+6an−1a_{n+1} = a_n + 6a_{n-1}. The sequence bnb_n is given by bn=∑k=0n(nk)ak.b_n=\sum_{k=0}^n \binom nk a_k.

    Find the coefficients α,β\alpha,\beta so that bnb_n satisfies the recurrence formula bn+1=αbn+βbn−1b_{n+1} = \alpha b_n + \beta b_{n-1}. Find the explicit form of bnb_n.

    Dataset text AoPS wiki problems. 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 at-oemo/2000/p1 · Tag TG02RMEZT4 · Edit this page on GitHub · Keys: j next, k previous