A Family of Fibonacci-like Sequences

P.R.J. Asveld

    Research output: Book/ReportReportOther research output

    28 Downloads (Pure)

    Abstract

    We consider the recurrence relation $G_n = G_{n-1} + G_{n-2} + \sum_{j=0}^k \alpha_j n^j$, where $G_0 = G_1 = 1$, and we express $G_n$ in terms of the Fibonacci numbers $F_n$ and $F_{n-1}$, and in the parameters $\alpha_1,\ldots,\alpha_k$.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Computer Science
    Number of pages4
    Publication statusPublished - 1985

    Publication series

    NameMemoranda Informatica
    PublisherUniversity of Twente, Department of Computer Science
    No.INF-85-10
    ISSN (Print)0924-3755

    Keywords

    • IR-66034
    • MSC-11B39
    • HMI-SLT: Speech and Language Technology
    • EWI-5227

    Cite this