razumovsky_r
- Academia Algebrae by Johann Faulhaber, 1631
- Cheat Sheet on Theoretical Computer Science
- MathOverflow discussion on A(m,r) coefficients, 2018
- Patterns in Pascal's Triangle by Alexander Bogomolny
- Studien Uber die Bernoullischen und Eulerschen Zahlen by J. Worpitzky, 1883
- MathOverflow discussion on U(m,n,k) coefficients, 2018
- arXiv:1011.0076 — The Pascal's identity
- Sums of powers of positive integers and their recurrence relations
- J. L. Gross, Combinatorial Methods with Computer Applications, 2008. [Chapter 4]
- How to write the sum of binomial coefficients in terms of polynomials in (n, k)
- arXiv:math/9207222 — D. E. Knuth, Johann Faulhaber and sums of powers
- Albert Tkaczyk — About the problem of a triangle
developing the polynomial function f(n)= n^m, 2018.
Google Drive
and
PDF
-
Albert Tkaczyk — On the problem of a triangle
developing the polynomial function f (n) = n ^ m - continuation, 2018.
Google Drive
and
PDF
- Albert Tkaczyk — On three-dimensional expansions of the polynomial function f(n)=n^m, 2023
- arXiv:2002.00550 — A two-sided Faulhaber-like formula involving Bernoulli polynomials
- MathOverflow — Discussion about generalization of sequence A287326 in OEIS, 2018
