Pascal Triangle Diagonal Sums
Cross-source consensus on Pascal Triangle Diagonal Sums from 1 sources and 4 claims.
1 sources · 4 claims
How it works
Benefits
Comparisons
Background
Highlighted claims
- The paper gives an explicit formula for sums over arbitrary diagonals kx+my=n in classical Pascal's triangle. — On a Generalized Fibonacci Recurrence
- The paper proves that the diagonal-sum sequence is a shifted version of the division-count sequence. — On a Generalized Fibonacci Recurrence
- The final diagonal-sum formula computes the diagonal quantity without directly solving kx+my=n. — On a Generalized Fibonacci Recurrence
- Green had shown that fixed coprime k,m diagonal-sum sequences satisfy the same two-lag recurrence for n at least m. — On a Generalized Fibonacci Recurrence