First-order Recurrence Relations
First-Order Recurrence Relations is a recurrence relation that defines each term of a sequence as a function of the immediately preceding term, distinguished from higher-order recurrence relations by depending on only one prior term.
22
Publications
722
Citations
30
Authors
22
Institutions
Publications per year
2017–2026
1
Parents
22
Computation with Recurrence Relations.
F. W. J. O., Jet Wimp · Mathematics of Computation · 1986 · 232 citations
A Note on Pure Recurrence Relations
Sister Mary Celine Fasenmyer · American Mathematical Monthly · 1949 · 38 citations
1–5 of 22
30
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 30
22
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
57 citations
Hitachi (Japan)
Tokyo, Japan
2 h-index
8 publications
80 citations

University of Amsterdam
Amsterdam, The Netherlands
1 h-index
1 publications
11 citations
Dalhousie University
Halifax, Canada
1 h-index
1 publications
32 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
17 citations
Computing Center
Khabarovsk, Russia
1 h-index
1 publications
25 citations

St Petersburg University
Saint Petersburg, Russia
1 h-index
1 publications
25 citations
Tiangong University
Tianjin, China
1 h-index
1 publications
25 citations
1–8 of 22
2 publications · 54 citations
2
h-index
Conference · 1 publications · 10 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 11 citations
1
h-index
MCOM · 1 publications · 232 citations
1
h-index
1–5