The generating function of a family of the sequences in terms of the continuant (Q628891): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2010.12.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022408881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Generalization of Fibonacci Sequence & Extended Binet's Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Fibonacci Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-Fibonacci sequence and the Pascal 2-triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377496 / rank
 
Normal rank

Latest revision as of 20:49, 3 July 2024

scientific article
Language Label Description Also known as
English
The generating function of a family of the sequences in terms of the continuant
scientific article

    Statements

    The generating function of a family of the sequences in terms of the continuant (English)
    0 references
    0 references
    8 March 2011
    0 references
    Let \(a_0,a_1,\dots,a_{r-1}\) be positive integers, and define the sequence \({q_m}\) by \[ q_0=1,\;q_1=1,\;q_m=a_tq_{m-1}+q_{m-2},\;m\geq 2,\;t\equiv m\pmod r. \] The author determines the generating function \(F(x)=\sum_{m=0}^\infty q_mx^m\).
    0 references
    recurrent sequence
    0 references
    generating function
    0 references

    Identifiers