Content deleted Content added
mathworld |
generalized Pascal triangles |
||
Line 1:
{{dablink|A related concept is that of a [[triangular matrix]].}}
[[Image:BellNumberAnimated.gif|right|thumb|The triangular array whose right-hand diagonal sequence consists of [[Bell numbers]]]]▼
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.
▲[[Image:BellNumberAnimated.gif|right|thumb|The triangular array whose right-hand diagonal sequence consists of [[Bell numbers]]]]
Notable particular examples include these:
Line 19 ⟶ 18:
* [[Stirling numbers of the first kind]]
* [[Stirling numbers of the second kind]]
Triangular arrays in which each row is symmetric and begins and ends with 1 are sometimes called '''generalized Pascal triangles'''; examples include Pascal's triangle and the triangle of Eulerian numbers.<ref>{{citation
| last = Barry | first = P.
| issue = 06.2.4
| journal = J. Integer Sequences
| pages = 1–34
| title = On integer-sequence-based constructions of generalized Pascal triangles
| url = http://www.emis.ams.org/journals/JIS/VOL9/Barry/barry91.pdf
| volume = 9
| year = 2006}}.</ref>
==See also==
* [[Triangular number]] is the number of entries in such an array.
==References==
{{reflist}}
==External links==
| |||