Prior Work
Cross-source consensus on Prior Work from 1 sources and 4 claims.
1 sources · 4 claims
Comparisons
Background
Highlighted claims
- For k=1,m=2, the relevant Pascal diagonal sums give Fibonacci numbers. — On a Generalized Fibonacci Recurrence
- Green generalized Fibonacci diagonal sums to x+my=n, while Dickinson and Raab handled related or partial cases. — On a Generalized Fibonacci Recurrence
- The paper presents its formula as more explicit than Green's main general result because it avoids computing extremal non-negative solutions. — On a Generalized Fibonacci Recurrence
- Dickinson's result covers only a subset of the diagonals addressed by this paper. — On a Generalized Fibonacci Recurrence