Generalized Fibonacci Recurrence
Cross-source consensus on Generalized Fibonacci Recurrence from 1 sources and 4 claims.
1 sources · 4 claims
Uses
How it works
Background
Highlighted claims
- The paper studies the recurrence g_n = g_{n-k}+g_{n-m} for positive integers k<m from branching and combinatorial perspectives. — On a Generalized Fibonacci Recurrence
- All four branching sequences in the paper satisfy the same recurrence with different initial conditions. — On a Generalized Fibonacci Recurrence
- The recurrence belongs to the broader family of generalized Fibonacci sequences but has special combinatorial interpretations. — On a Generalized Fibonacci Recurrence
- For coprime k and m, asymptotic behavior is expressed using the unique positive root of 1-x^k-x^m=0. — On a Generalized Fibonacci Recurrence