{
  "index": "1990-A-1",
  "type": "COMB",
  "tag": [
    "COMB",
    "NT",
    "ALG"
  ],
  "difficulty": "",
  "question": "\\[\nT_0 = 2, T_1 = 3, T_2 = 6,\n\\]\nand for $n \\geq 3$,\n\\[\nT_n = (n+4)T_{n-1} - 4n T_{n-2} + (4n-8) T_{n-3}.\n\\]\nThe first few terms are\n\\[\n2, 3, 6, 14, 40, 152, 784, 5168, 40576.\n\\]\nFind, with proof, a formula for $T_n$ of the form $T_n = A_n + B_n$,\nwhere $\\{A_n\\}$ and $\\{B_n\\}$ are well-known sequences.",
  "solution": "Solution. The formula \\( T_{n}=n!+2^{n} \\) can be verified by induction.\nAlternatively, set \\( t_{n}=n!+2^{n} \\). Clearly \\( t_{0}=2=T_{0}, t_{1}=3=T_{1} \\) and \\( t_{2}=6=T_{2} \\). Also,\n\\[\nt_{n}-n t_{n-1}=2^{n}-n 2^{n-1}\n\\]\n\nNow \\( 2^{n} \\) and \\( n 2^{n-1} \\) are both solutions of the linear recursion\n\\[\nf_{n}-4 f_{n-1}+4 f_{n-2}=0\n\\]\nthis follows from direct substitution. Since \\( t_{n}-n t_{n-1} \\) is a linear combination of solutions to (1), it must also be a solution. Hence\n\\[\n\\left(t_{n}-n t_{n-1}\\right)-4\\left(t_{n-1}-(n-1) t_{n-2}\\right)+4\\left(t_{n-2}-(n-2) t_{n-3}\\right)=0\n\\]\nor equivalently,\n\\[\nt_{n}=(n+4) t_{n-1}-4 n t_{n-2}+(4 n-8) t_{n-3}\n\\]\n\nThus \\( t_{n}=T_{n} \\), because they are identical for \\( n=0,1,2 \\) and satisfy the same third-order recursion (1) for \\( n \\geq 3 \\).\n\nRemark. Let \\( \\left\\{t_{n}^{(1)}\\right\\}_{n \\geq 1},\\left\\{t_{n}^{(2)}\\right\\}_{n \\geq 1}, \\ldots,\\left\\{t_{n}^{(m)}\\right\\}_{n \\geq 1} \\) be sequences, each of one of the following forms:\n(i) \\( \\left\\{\\alpha^{n}\\right\\}_{n \\geq 1} \\) for some \\( \\alpha \\in \\mathbb{C} \\),\n(ii) \\( \\{P(n)\\}_{n \\geq 1} \\) for some polynomial \\( P \\in \\mathbb{C}[n] \\),\n(iii) \\( \\{(a n+b)!\\}_{n \\geq 1} \\) for some integers \\( a, b \\geq 0 \\).\n\nLet \\( Q \\in \\mathbb{C}\\left[x_{1}, \\ldots, x_{m}\\right] \\) be a polynomial, and define \\( u_{n}=Q\\left(t_{n}^{(1)}, \\ldots, t_{n}^{(m)}\\right) \\) for \\( n \\geq 1 \\). Then one can show that the sequences \\( \\left\\{u_{n}\\right\\}_{n \\geq 1},\\left\\{u_{n+1}\\right\\}_{n \\geq 1},\\left\\{u_{n+2}\\right\\}_{n \\geq 1}, \\ldots \\), thought of as functions of \\( n \\), lie in a finitely generated \\( \\mathbb{C}[n] \\)-submodule of the \\( \\mathbb{C}[n] \\)-module of all sequences of complex numbers. Therefore \\( \\left\\{u_{n}\\right\\} \\) satisfies a nontrivial linear recursion with polynomial coefficients. The reader may enjoy finding this recursion explicitly for sequences such as \\( (n!)^{2}+3^{n} \\) or \\( 2^{n} n!+F_{n} \\) where \\( F_{n} \\) is the \\( n \\)th Fibonacci number, defined at the end of 1988A5. Problem 1984B1 [PutnamII, p. 44] is a variation on this theme:\n\nLet \\( n \\) be a positive integer, and define\n\\[\nf(n)=1!+2!+\\cdots+n!\n\\]\n\nFind polynomials \\( P(x) \\) and \\( Q(x) \\) such that\n\\[\nf(n+2)=P(n) f(n+1)+Q(n) f(n)\n\\]\nfor all \\( n \\geq 1 \\).",
  "vars": [
    "n",
    "T_n",
    "T_n-1",
    "T_n-2",
    "T_n-3",
    "A_n",
    "B_n",
    "t_n",
    "t_n-1",
    "t_n-2",
    "t_n-3",
    "f_n",
    "f_n-1",
    "f_n-2",
    "u_n",
    "u_n+1",
    "u_n+2",
    "F_n"
  ],
  "params": [
    "T_0",
    "T_1",
    "T_2",
    "t_0",
    "t_1",
    "t_2",
    "a",
    "b",
    "P",
    "Q",
    "\\\\alpha"
  ],
  "sci_consts": [],
  "variants": {
    "descriptive_long": {
      "map": {
        "n": "indexvar",
        "T_n": "seqtelem",
        "T_n-1": "seqtprev",
        "T_n-2": "seqtprevtwo",
        "T_n-3": "seqtprevthr",
        "A_n": "seqaelem",
        "B_n": "seqbelem",
        "t_n": "auxtelem",
        "t_n-1": "auxtprev",
        "t_n-2": "auxtprevtwo",
        "t_n-3": "auxtprevthr",
        "f_n": "seqfelem",
        "f_n-1": "seqfprev",
        "f_n-2": "seqfprevtwo",
        "u_n": "sequelem",
        "u_n+1": "sequnext",
        "u_n+2": "sequplus2",
        "F_n": "fibnelem",
        "T_0": "seqtzero",
        "T_1": "seqtone",
        "T_2": "seqttwo",
        "t_0": "auxtzero",
        "t_1": "auxtone",
        "t_2": "auxttwo",
        "a": "intparama",
        "b": "intparamb",
        "P": "polynomp",
        "Q": "polynomyq",
        "\\alpha": "alphaparam"
      },
      "question": "\\[\nseqtzero = 2, seqtone = 3, seqttwo = 6,\n\\]\nand for $indexvar \\geq 3$,\n\\[\nseqtelem = (indexvar+4)seqtprev - 4 indexvar seqtprevtwo + (4 indexvar-8) seqtprevthr.\n\\]\nThe first few terms are\n\\[\n2, 3, 6, 14, 40, 152, 784, 5168, 40576.\n\\]\nFind, with proof, a formula for $seqtelem$ of the form $seqtelem = seqaelem + seqbelem$,\nwhere $\\{seqaelem\\}$ and $\\{seqbelem\\}$ are well-known sequences.",
      "solution": "Solution. The formula \\( seqtelem=indexvar!+2^{indexvar} \\) can be verified by induction.\nAlternatively, set \\( auxtelem=indexvar!+2^{indexvar} \\). Clearly \\( auxtzero=2=seqtzero, auxtone=3=seqtone \\) and \\( auxttwo=6=seqttwo \\). Also,\n\\[\nauxtelem-indexvar auxtprev=2^{indexvar}-indexvar 2^{indexvar-1}\n\\]\n\nNow \\( 2^{indexvar} \\) and \\( indexvar 2^{indexvar-1} \\) are both solutions of the linear recursion\n\\[\nseqfelem-4 seqfprev+4 seqfprevtwo=0\n\\]\nthis follows from direct substitution. Since \\( auxtelem-indexvar auxtprev \\) is a linear combination of solutions to (1), it must also be a solution. Hence\n\\[\n\\left(auxtelem-indexvar auxtprev\\right)-4\\left(auxtprev-(indexvar-1) auxtprevtwo\\right)+4\\left(auxtprevtwo-(indexvar-2) auxtprevthr\\right)=0\n\\]\nor equivalently,\n\\[\nauxtelem=(indexvar+4) auxtprev-4 indexvar auxtprevtwo+(4 indexvar-8) auxtprevthr\n\\]\n\nThus \\( auxtelem=seqtelem \\), because they are identical for \\( indexvar=0,1,2 \\) and satisfy the same third-order recursion (1) for \\( indexvar \\geq 3 \\).\n\nRemark. Let \\( \\{auxtelem^{(1)}\\}_{indexvar \\geq 1},\\{auxtelem^{(2)}\\}_{indexvar \\geq 1}, \\ldots,\\{auxtelem^{(m)}\\}_{indexvar \\geq 1} \\) be sequences, each of one of the following forms:\n(i) \\( \\{alphaparam^{indexvar}\\}_{indexvar \\geq 1} \\) for some \\( alphaparam \\in \\mathbb{C} \\),\n(ii) \\( \\{polynomp(indexvar)\\}_{indexvar \\geq 1} \\) for some polynomial \\( polynomp \\in \\mathbb{C}[indexvar] \\),\n(iii) \\( \\{(intparama indexvar+intparamb)!\\}_{indexvar \\geq 1} \\) for some integers \\( intparama, intparamb \\geq 0 \\).\n\nLet \\( polynomyq \\in \\mathbb{C}[x_{1}, \\ldots, x_{m}] \\) be a polynomial, and define \\( sequelem=polynomyq(auxtelem^{(1)}, \\ldots, auxtelem^{(m)}) \\) for \\( indexvar \\geq 1 \\). Then one can show that the sequences \\( \\{sequelem\\}_{indexvar \\geq 1},\\{sequnext\\}_{indexvar \\geq 1},\\{sequplus2\\}_{indexvar \\geq 1}, \\ldots \\), thought of as functions of \\( indexvar \\), lie in a finitely generated \\( \\mathbb{C}[indexvar] \\)-submodule of the \\( \\mathbb{C}[indexvar] \\)-module of all sequences of complex numbers. Therefore \\( \\{sequelem\\} \\) satisfies a nontrivial linear recursion with polynomial coefficients. The reader may enjoy finding this recursion explicitly for sequences such as \\( (indexvar!)^{2}+3^{indexvar} \\) or \\( 2^{indexvar} indexvar!+fibnelem \\) where \\( fibnelem \\) is the \\( indexvar \\)th Fibonacci number, defined at the end of 1988A5. Problem 1984B1 [PutnamII, p. 44] is a variation on this theme:\n\nLet \\( indexvar \\) be a positive integer, and define\n\\[\nf(indexvar)=1!+2!+\\cdots+indexvar!\n\\]\n\nFind polynomials \\( polynomp(x) \\) and \\( polynomyq(x) \\) such that\n\\[\nf(indexvar+2)=polynomp(indexvar) f(indexvar+1)+polynomyq(indexvar) f(indexvar)\n\\]\nfor all \\( indexvar \\geq 1 \\)."
    },
    "descriptive_long_confusing": {
      "map": {
        "n": "telescope",
        "T_n": "windmill",
        "T_n-1": "snowball",
        "T_n-2": "lighthouse",
        "T_n-3": "saxophone",
        "A_n": "pineapple",
        "B_n": "typewriter",
        "t_n": "porcupine",
        "t_n-1": "playhouse",
        "t_n-2": "butterfly",
        "t_n-3": "drumstick",
        "f_n": "sandboxer",
        "f_n-1": "moonlight",
        "f_n-2": "rainstorm",
        "u_n": "stargazer",
        "u_n+1": "bookstore",
        "u_n+2": "earthling",
        "F_n": "framework",
        "T_0": "crossroad",
        "T_1": "hairbrush",
        "T_2": "peppermint",
        "t_0": "cornfield",
        "t_1": "waterfall",
        "t_2": "skyladder",
        "a": "honeycomb",
        "b": "newspaper",
        "P": "dragonfly",
        "Q": "cheeseboard",
        "\\\\alpha": "roadrunner"
      },
      "question": "\\[\ncrossroad = 2, hairbrush = 3, peppermint = 6,\n\\]\nand for $telescope \\geq 3$,\n\\[\nwindmill = (telescope+4)snowball - 4telescope lighthouse + (4telescope-8) saxophone.\n\\]\nThe first few terms are\n\\[\n2, 3, 6, 14, 40, 152, 784, 5168, 40576.\n\\]\nFind, with proof, a formula for $windmill$ of the form $windmill = pineapple + typewriter$,\nwhere $\\{pineapple\\}$ and $\\{typewriter\\}$ are well-known sequences.",
      "solution": "Solution. The formula \\( windmill = telescope! + 2^{telescope} \\) can be verified by induction.\nAlternatively, set \\( porcupine = telescope! + 2^{telescope} \\). Clearly \\( cornfield = 2 = crossroad,\\, waterfall = 3 = hairbrush \\) and \\( skyladder = 6 = peppermint \\). Also,\n\\[\nporcupine - telescope\\, playhouse = 2^{telescope} - telescope\\, 2^{telescope-1}\n\\]\n\nNow \\( 2^{telescope} \\) and \\( telescope\\, 2^{telescope-1} \\) are both solutions of the linear recursion\n\\[\nsandboxer - 4\\, moonlight + 4\\, rainstorm = 0\n\\]\nthis follows from direct substitution. Since \\( porcupine - telescope\\, playhouse \\) is a linear combination of solutions to (1), it must also be a solution. Hence\n\\[\n\\left(porcupine - telescope\\, playhouse\\right) - 4\\left(playhouse - (telescope-1)\\, butterfly\\right) + 4\\left(butterfly - (telescope-2)\\, drumstick\\right)=0\n\\]\nor equivalently,\n\\[\nporcupine = (telescope+4)\\, playhouse - 4\\, telescope\\, butterfly + (4\\, telescope - 8)\\, drumstick\n\\]\n\nThus \\( porcupine = windmill \\), because they are identical for \\( telescope = 0,1,2 \\) and satisfy the same third-order recursion (1) for \\( telescope \\geq 3 \\).\n\nRemark. Let \\( \\{porcupine^{(1)}\\}_{telescope \\geq 1},\\{porcupine^{(2)}\\}_{telescope \\geq 1}, \\ldots,\\{porcupine^{(m)}\\}_{telescope \\geq 1} \\) be sequences, each of one of the following forms:\n(i) \\( \\{roadrunner^{telescope}\\}_{telescope \\geq 1} \\) for some \\( roadrunner \\in \\mathbb{C} \\),\n(ii) \\( \\{dragonfly(telescope)\\}_{telescope \\geq 1} \\) for some polynomial \\( dragonfly \\in \\mathbb{C}[telescope] \\),\n(iii) \\( \\{(honeycomb\\, telescope + newspaper)!\\}_{telescope \\geq 1} \\) for some integers \\( honeycomb, newspaper \\geq 0 \\).\n\nLet \\( cheeseboard \\in \\mathbb{C}[x_{1}, \\ldots, x_{m}] \\) be a polynomial, and define \\( stargazer = cheeseboard(porcupine^{(1)}, \\ldots, porcupine^{(m)}) \\) for \\( telescope \\geq 1 \\). Then one can show that the sequences \\( \\{stargazer\\}_{telescope \\geq 1},\\{bookstore\\}_{telescope \\geq 1},\\{earthling\\}_{telescope \\geq 1}, \\ldots \\), thought of as functions of \\( telescope \\), lie in a finitely generated \\( \\mathbb{C}[telescope] \\)-submodule of the \\( \\mathbb{C}[telescope] \\)-module of all sequences of complex numbers. Therefore \\( \\{stargazer\\} \\) satisfies a nontrivial linear recursion with polynomial coefficients. The reader may enjoy finding this recursion explicitly for sequences such as \\( (telescope!)^{2} + 3^{telescope} \\) or \\( 2^{telescope}\\, telescope! + framework \\) where \\( framework \\) is the \\( telescope \\)th Fibonacci number, defined at the end of 1988A5. Problem 1984B1 [PutnamII, p.~44] is a variation on this theme:\n\nLet \\( telescope \\) be a positive integer, and define\n\\[\nf(telescope) = 1! + 2! + \\cdots + telescope!\n\\]\n\nFind polynomials \\( dragonfly(x) \\) and \\( cheeseboard(x) \\) such that\n\\[\nf(telescope+2) = dragonfly(telescope) f(telescope+1) + cheeseboard(telescope) f(telescope)\n\\]\nfor all \\( telescope \\geq 1 \\)."
    },
    "descriptive_long_misleading": {
      "map": {
        "n": "continuum",
        "T_n": "immutablevalue",
        "T_n-1": "immutablevalueprev",
        "T_n-2": "immutablevaluepreprev",
        "T_n-3": "immutablevalueprepreprev",
        "A_n": "terminusseq",
        "B_n": "originseq",
        "t_n": "persistentvalue",
        "t_n-1": "persistentvalueprev",
        "t_n-2": "persistentvaluepreprev",
        "t_n-3": "persistentvalueprepreprev",
        "f_n": "staticdata",
        "f_n-1": "staticdataprev",
        "f_n-2": "staticdatapreprev",
        "u_n": "stationaryvalue",
        "u_n+1": "stationaryvaluenext",
        "u_n+2": "stationaryvaluenexter",
        "F_n": "nonfibonacciseq",
        "T_0": "immutablevaluezero",
        "T_1": "immutablevalueone",
        "T_2": "immutablevaluetwo",
        "t_0": "persistentvaluezero",
        "t_1": "persistentvalueone",
        "t_2": "persistentvaluetwo",
        "a": "antistart",
        "b": "nonalpha",
        "P": "nonpolynomial",
        "Q": "nonlinear",
        "\\\\alpha": "oppositealpha"
      },
      "question": "\\[\nimmutablevaluezero = 2, immutablevalueone = 3, immutablevaluetwo = 6,\n\\]\nand for $continuum \\geq 3$,\n\\[\nimmutablevalue = (continuum+4)immutablevalueprev - 4continuum immutablevaluepreprev + (4continuum-8) immutablevalueprepreprev.\n\\]\nThe first few terms are\n\\[\n2, 3, 6, 14, 40, 152, 784, 5168, 40576.\n\\]\nFind, with proof, a formula for $immutablevalue$ of the form $immutablevalue = terminusseq + originseq$,\nwhere $\\{terminusseq\\}$ and $\\{originseq\\}$ are well-known sequences.",
      "solution": "Solution. The formula \\( immutablevalue = continuum!+2^{continuum} \\) can be verified by induction.\nAlternatively, set \\( persistentvalue = continuum!+2^{continuum} \\). Clearly \\( persistentvaluezero =2=immutablevaluezero, persistentvalueone =3=immutablevalueone \\) and \\( persistentvaluetwo =6=immutablevaluetwo \\). Also,\n\\[\npersistentvalue- continuum persistentvalueprev = 2^{continuum} - continuum 2^{continuum-1}\n\\]\n\nNow \\( 2^{continuum} \\) and \\( continuum 2^{continuum-1} \\) are both solutions of the linear recursion\n\\[\nstaticdata-4 staticdataprev+4 staticdatapreprev=0\n\\]\nthis follows from direct substitution. Since \\( persistentvalue- continuum persistentvalueprev \\) is a linear combination of solutions to (1), it must also be a solution. Hence\n\\[\n\\left(persistentvalue- continuum persistentvalueprev\\right)-4\\left(persistentvalueprev-(continuum-1) persistentvaluepreprev\\right)+4\\left(persistentvaluepreprev-(continuum-2) persistentvalueprepreprev\\right)=0\n\\]\nor equivalently,\n\\[\npersistentvalue=(continuum+4) persistentvalueprev-4 continuum persistentvaluepreprev+(4 continuum-8) persistentvalueprepreprev\n\\]\n\nThus \\( persistentvalue=immutablevalue \\), because they are identical for \\( continuum=0,1,2 \\) and satisfy the same third-order recursion (1) for \\( continuum \\geq 3 \\).\n\nRemark. Let \\( \\left\\{stationaryvalue^{(1)}\\right\\}_{continuum \\geq 1},\\left\\{stationaryvalue^{(2)}\\right\\}_{continuum \\geq 1}, \\ldots,\\left\\{stationaryvalue^{(m)}\\right\\}_{continuum \\geq 1} \\) be sequences, each of one of the following forms:\n(i) \\( \\left\\{oppositealpha^{continuum}\\right\\}_{continuum \\geq 1} \\) for some \\( oppositealpha \\in \\mathbb{C} \\),\n(ii) \\( \\{nonpolynomial(continuum)\\}_{continuum \\geq 1} \\) for some polynomial \\( nonpolynomial \\in \\mathbb{C}[continuum] \\),\n(iii) \\( \\{(antistart continuum+nonalpha)!\\}_{continuum \\geq 1} \\) for some integers \\( antistart, nonalpha \\geq 0 \\).\n\nLet \\( nonlinear \\in \\mathbb{C}\\left[x_{1}, \\ldots, x_{m}\\right] \\) be a polynomial, and define \\( staticmember = nonlinear\\left(stationaryvalue^{(1)}, \\ldots, stationaryvalue^{(m)}\\right) \\) for \\( continuum \\geq 1 \\). Then one can show that the sequences \\( \\left\\{staticmember\\right\\}_{continuum \\geq 1},\\left\\{staticmember_{continuum+1}\\right\\}_{continuum \\geq 1},\\left\\{staticmember_{continuum+2}\\right\\}_{continuum \\geq 1}, \\ldots \\), thought of as functions of \\( continuum \\), lie in a finitely generated \\( \\mathbb{C}[continuum] \\)-submodule of the \\( \\mathbb{C}[continuum] \\)-module of all sequences of complex numbers. Therefore \\( \\left\\{staticmember\\right\\} \\) satisfies a nontrivial linear recursion with polynomial coefficients. The reader may enjoy finding this recursion explicitly for sequences such as \\( (continuum!)^{2}+3^{continuum} \\) or \\( 2^{continuum} continuum!+nonfibonacciseq \\) where \\( nonfibonacciseq \\) is the \\( continuum \\)th Fibonacci number, defined at the end of 1988A5. Problem 1984B1 [PutnamII, p. 44] is a variation on this theme:\n\nLet \\( continuum \\) be a positive integer, and define\n\\[\nf(continuum)=1!+2!+\\cdots+continuum!\n\\]\n\nFind polynomials \\( nonpolynomial_1(x) \\) and \\( nonlinear_1(x) \\) such that\n\\[\nf(continuum+2)=nonpolynomial_1(continuum) f(continuum+1)+nonlinear_1(continuum) f(continuum)\n\\]\nfor all \\( continuum \\geq 1 \\)."
    },
    "garbled_string": {
      "map": {
        "n": "lkjhqzpw",
        "T_n": "vrmxtspo",
        "T_n-1": "zcytqubd",
        "T_n-2": "obekxgmi",
        "T_n-3": "afpnrewq",
        "A_n": "huclyzva",
        "B_n": "qsdvnxmi",
        "t_n": "pgfwceho",
        "t_n-1": "gmbzlerq",
        "t_n-2": "jvrwhtco",
        "t_n-3": "fkymaqux",
        "f_n": "wqktsdge",
        "f_n-1": "yvbanhfr",
        "f_n-2": "dnqsimob",
        "u_n": "xporvjke",
        "u_n+1": "uaejtkim",
        "u_n+2": "mgqxzoph",
        "F_n": "lkpsedji",
        "T_0": "cmtpyrav",
        "T_1": "ejhrabnf",
        "T_2": "tmzcxgou",
        "t_0": "kabnqvhs",
        "t_1": "lfunwxed",
        "t_2": "hazrkgom",
        "a": "kngsobqi",
        "b": "vzmlwaru",
        "P": "pqzmdyoc",
        "Q": "rmfsalgv",
        "\\alpha": "qpjxslmt"
      },
      "question": "\\[\ncmtpyrav = 2, ejhrabnf = 3, tmzcxgou = 6,\n\\]\nand for $lkjhqzpw \\geq 3$,\n\\[\nvrmxtspo = (lkjhqzpw+4)zcytqubd - 4lkjhqzpw \\, obekxgmi + (4lkjhqzpw-8) \\, afpnrewq.\n\\]\nThe first few terms are\n\\[\n2, 3, 6, 14, 40, 152, 784, 5168, 40576.\n\\]\nFind, with proof, a formula for $vrmxtspo$ of the form $vrmxtspo = huclyzva + qsdvnxmi$,\nwhere $\\{huclyzva\\}$ and $\\{qsdvnxmi\\}$ are well-known sequences.",
      "solution": "Solution. The formula \\( vrmxtspo = lkjhqzpw! + 2^{lkjhqzpw} \\) can be verified by induction.  \nAlternatively, set \\( pgfwceho = lkjhqzpw! + 2^{lkjhqzpw} \\). Clearly \\( kabnqvhs = 2 = cmtpyrav, \\, lfunwxed = 3 = ejhrabnf \\) and \\( hazrkgom = 6 = tmzcxgou \\). Also,\n\\[\npgfwceho - lkjhqzpw\\, gmbzlerq = 2^{lkjhqzpw} - lkjhqzpw \\, 2^{lkjhqzpw-1}\n\\]\nNow \\( 2^{lkjhqzpw} \\) and \\( lkjhqzpw \\, 2^{lkjhqzpw-1} \\) are both solutions of the linear recursion\n\\[\nwqktsdge - 4 \\, yvbanhfr + 4 \\, dnqsimob = 0\n\\]\nthis follows from direct substitution. Since \\( pgfwceho - lkjhqzpw\\, gmbzlerq \\) is a linear combination of solutions to (1), it must also be a solution. Hence\n\\[\n\\left(pgfwceho - lkjhqzpw\\, gmbzlerq\\right) - 4\\left(gmbzlerq - (lkjhqzpw-1)\\, jvrwhtco\\right) + 4\\left(jvrwhtco - (lkjhqzpw-2)\\, fkymaqux\\right) = 0\n\\]\nor equivalently,\n\\[\npgfwceho = (lkjhqzpw+4) \\, gmbzlerq - 4\\, lkjhqzpw \\, jvrwhtco + (4\\, lkjhqzpw - 8) \\, fkymaqux\n\\]\nThus \\( pgfwceho = vrmxtspo \\), because they are identical for \\( lkjhqzpw = 0,1,2 \\) and satisfy the same third-order recursion (1) for \\( lkjhqzpw \\geq 3 \\).\n\nRemark. Let \\( \\{pgfwceho^{(1)}\\}_{lkjhqzpw \\geq 1}, \\{pgfwceho^{(2)}\\}_{lkjhqzpw \\geq 1}, \\ldots, \\{pgfwceho^{(m)}\\}_{lkjhqzpw \\geq 1} \\) be sequences, each of one of the following forms:  \n(i) \\( \\{qpjxslmt^{lkjhqzpw}\\}_{lkjhqzpw \\geq 1} \\) for some \\( qpjxslmt \\in \\mathbb{C} \\),  \n(ii) \\( \\{pqzmdyoc(lkjhqzpw)\\}_{lkjhqzpw \\geq 1} \\) for some polynomial \\( pqzmdyoc \\in \\mathbb{C}[lkjhqzpw] \\),  \n(iii) \\( \\{(kngsobqi\\, lkjhqzpw + vzmlwaru)!\\}_{lkjhqzpw \\geq 1} \\) for some integers \\( kngsobqi, vzmlwaru \\geq 0 \\).\n\nLet \\( rmfsalgv \\in \\mathbb{C}[x_{1}, \\ldots, x_{m}] \\) be a polynomial, and define \\( xporvjke = rmfsalgv\\left(pgfwceho^{(1)}, \\ldots, pgfwceho^{(m)}\\right) \\) for \\( lkjhqzpw \\geq 1 \\). Then one can show that the sequences \\( \\{xporvjke\\}_{lkjhqzpw \\geq 1}, \\{uaejtkim\\}_{lkjhqzpw \\geq 1}, \\{mgqxzoph\\}_{lkjhqzpw \\geq 1}, \\ldots \\), thought of as functions of \\( lkjhqzpw \\), lie in a finitely generated \\( \\mathbb{C}[lkjhqzpw] \\)-submodule of the \\( \\mathbb{C}[lkjhqzpw] \\)-module of all sequences of complex numbers. Therefore \\( \\{xporvjke\\} \\) satisfies a nontrivial linear recursion with polynomial coefficients. The reader may enjoy finding this recursion explicitly for sequences such as \\( (lkjhqzpw!)^{2} + 3^{lkjhqzpw} \\) or \\( 2^{lkjhqzpw} \\, lkjhqzpw! + lkpsedji \\) where \\( lkpsedji \\) is the \\( lkjhqzpw \\)th Fibonacci number, defined at the end of 1988A5. Problem 1984B1 [PutnamII, p. 44] is a variation on this theme:\n\nLet \\( lkjhqzpw \\) be a positive integer, and define\n\\[\nf(lkjhqzpw)=1!+2!+\\cdots+lkjhqzpw!\n\\]\nFind polynomials \\( pqzmdyoc(x) \\) and \\( rmfsalgv(x) \\) such that\n\\[\nf(lkjhqzpw+2)=pqzmdyoc(lkjhqzpw) f(lkjhqzpw+1)+rmfsalgv(lkjhqzpw) f(lkjhqzpw)\n\\]\nfor all \\( lkjhqzpw \\geq 1 \\)."
    },
    "kernel_variant": {
      "question": "Define a sequence \\(\\{T_n\\}_{n\\ge 0}\\) by\n\\[T_0=8,\\qquad T_1=10,\\qquad T_2=23,\\]\nand for every integer \\(n\\ge 3\\)\n\\[\nT_n=(n+6)T_{n-1}-3(2n+1)T_{n-2}+9(n-2)T_{n-3}.\n\\]\nThe first few terms are\n\\[\n8,\\;10,\\;23,\\;69,\\;249,\\;1083,\\;5769,\\;\\dots\n\\]\nFind, with proof, a closed formula of the form\n\\[T_n=A_n+B_n,\\]\nwhere each of the sequences \\(\\{A_n\\}\\) and \\(\\{B_n\\}\\) is familiar from a standard undergraduate course.",
      "solution": "We claim that\n\\[\n\\boxed{\\;T_n=7\\,n!+3^{n}\\;}\\quad(n\\ge0).\n\\]\nDefine\n\\[\nt_n:=7\\,n!+3^{n}\\quad(n\\ge0).\n\\]\n\nStep 1. Initial agreement:\n\\[\n t_0=7\\cdot0!+3^0=8=T_0,\\quad\n t_1=7\\cdot1!+3^1=10=T_1,\\quad\n t_2=7\\cdot2!+3^2=23=T_2.\n\\]\n\nStep 2. Form the auxiliary difference\n\\[\n d_n:=t_n-n\\,t_{n-1}\\quad(n\\ge1).\n\\]\nSince $t_{n-1}=7(n-1)!+3^{n-1}$,\n\\[\n d_n=(7n!+3^n)-n(7(n-1)!+3^{n-1})=3^n-n\\,3^{n-1}.\n\\]\n\nStep 3. A constant‐coefficient recursion for $d_n$.\nBoth $3^n$ and $n3^{n-1}$ satisfy\n\\[\n f_n-6f_{n-1}+9f_{n-2}=0,\\]\nsince the characteristic polynomial $(x-3)^2=0$ has double root 3. Hence\n\\[\n d_n-6d_{n-1}+9d_{n-2}=0\\quad(n\\ge3).\n\\]\n\nStep 4. Translate into a recursion for $t_n$.\nSince $d_n=t_n-n t_{n-1}$, for $n\\ge3$:\n\\[\n (t_n-n t_{n-1})-6(t_{n-1}-(n-1)t_{n-2})+9(t_{n-2}-(n-2)t_{n-3})=0.\n\\]\nExpanding and collecting terms gives\n\\[\n t_n-(n+6)t_{n-1}+(6(n-1)+9)t_{n-2}-9(n-2)t_{n-3}=0,\n\\]\ni.e.\n\\[\n \\boxed{\\;t_n=(n+6)t_{n-1}-3(2n+1)t_{n-2}+9(n-2)t_{n-3}\\;},\n\\]\nwhich matches the defining recurrence of $T_n$.\n\nStep 5. Identification with $T_n$.\nSince $t_0=T_0,t_1=T_1,t_2=T_2$ and both satisfy the same recurrence, by induction $t_n=T_n$ for all $n$. Hence\n\\[\n T_n=7\\,n!+3^n,\n\\]\nand one may take the familiar sequences\n\\[\n A_n=7\\,n!,\\quad B_n=3^n.\n\\]",
      "_meta": {
        "core_steps": [
          "Propose t_n = n! + 2^n as candidate closed-form",
          "Verify t_n equals T_n for the three initial indices (order of recursion)",
          "Form d_n = t_n − n·t_{n−1} = 2^n − n·2^{n−1}",
          "Note both 2^n and n·2^{n−1} satisfy the constant–coefficient recursion f_n − 4f_{n−1} + 4f_{n−2} = 0, hence so does d_n",
          "Translate that fact to obtain t_n = (n+4)t_{n−1} − 4n t_{n−2} + (4n−8)t_{n−3}; with same recurrence and initial data, t_n ≡ T_n"
        ],
        "mutable_slots": {
          "slot1": {
            "description": "Base of the exponential subsequence; changing it forces parallel changes in all coefficients produced from it.",
            "original": "2"
          },
          "slot2": {
            "description": "Scalar multiplier in front of n! in the closed-form expression; it cancels out in d_n and never affects the proof.",
            "original": "1"
          }
        }
      }
    }
  },
  "checked": true,
  "problem_type": "proof"
}