J. H. Conway and R. K. Guy, Pascal's Triangle In The Book of Numbers, pp.68-70, 1996.

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas , Graphs, and Mathematical Tables, 9th printing, p.10, 1972.

G. Arfken, Mathematical Methods for Physicists, pp.307-308, 1985.
DOI : 10.1119/1.1973757

E. W. Weisstein, Finite Difference, From Mathworld

C. H. Richardson, An Introduction to the Calculus of Finite Differences, p.5, 1954.

J. Faulhaber and A. Algebrae, Darinnen die miraculosische Inventiones zu den höchsten Cossen weiters continuirt und profitiert werden, Augspurg, bey Johann Ulrich Schönigs, 1631. (Call number QA154.8 F3 1631a f MATH at Stanford University Libraries.), online copy

N. S. Bakhvalov, Numerical Methods: Analysis, Algebra, Ordinary Differential Equations p. 59, 1977.

O. The and . Inc, The On-Line Encyclopedia of Integer Sequences, 1964-present https

N. J. Sloane, Coordination sequence for hexagonal lattice, A008458 in [9], p.2002

K. Petro, Entry Triangle read by rows: T (n, k) = 6 * (n ? k) * k + 1, 2017.

N. J. Sloane and M. Bernstein, Pascal's Triangle, Entry A007318 in, issue.9, p.1994

N. J. Sloane, Central polygonal numbers, Entry A000124 in, issue.9, p.1994

E. W. Weisstein, ?. Mathworld, and . Resource, Bernoulli Number

K. Petro, Triangle read by rows: T (n, k) = 30 * (n?k) 2 * k 2 +1, Entry, 2018.

K. Petro, Triangle read by rows: T (n, k) = 140 * (n ? k) 3 * k 3 * ?14 * (n ? k) * k + 1, Entry, 2018.

K. Petro, Triangle read by rows: Numeator(A m,j ), 0 ? j ? m, Entry, issue.0, 2018.

K. Petro, Triangle read by rows: Denominator(A m,j ), 0 ? j ? m, Entry, issue.0, 2018.

N. J. Sloane, Entry " a(n) = (2n + 1)!/n! 2, pp.2457-2466

J. Giambalvo, Entry " a(n) = 2 * n 3 + 3 * n 2, 2016.

E. Donald and . Knuth, Johann Faulhaber and Sums of Powers, pp. 9-10., arXiv preprint, arXiv:math/9207222v1, 1992.

J. Keane, Entry " 6 times triangular numbers: a(n) = 3 * n * (n + 1), A028896 in [9]github.io/mathematica codes/solutions system 2 4.txt, 1999.

P. Luschny, Triangle read by rows: coefficients in the sum of odd powers as expressed by Faulhaber's theorem, T (n, k) for n ? 1, 1 ? k ? n, 2018.

E. Donald and . Knuth, Two notes on notation., pp. 1-2, arXiv preprint, arXiv:math, p.9205211, 1992.

R. Zumkeller, Entry Triangle read by rows: T (n, k) = k(n ? k), 1 ? k ? n, 2004.

N. Early, Combinatorics and Representation Theory for Generalized Permutohedra I: Simplicial Plates., p. 3, arXiv preprint, p.2016