Triangular array
In mathematics and computing, a triangular array of numbers, polynomials, or the like, is a doubly indexed sequence in which each row is only as long as the row's own index.
Notable particular examples include these:
- Bell numbers (the "Bell triangle", "Aitken's array", or the "Peirce triangle")
- Bell polynomials
- Boustrophedon transform
- Eulerian number
- Floyd's triangle
- Lozanić's triangle
- Narayana number
- Pascal's triangle
- Rencontres numbers
- Romberg's method
- Stirling numbers of the first kind
- Stirling numbers of the second kind
Triangular arrays of integers in which each row is symmetric and begins and ends with 1 are sometimes called generalized Pascal triangles; examples include Pascal's triangle, the Narayana numbers, and the triangle of Eulerian numbers.[1]
See also
- Triangular number is the number of entries in such an array.
References
- ^ Barry, P. (2006), "On integer-sequence-based constructions of generalized Pascal triangles" (PDF), J. Integer Sequences, 9 (06.2.4): 1–34.
External links
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
 | This computing article is a stub. You can help Wikipedia by expanding it. |