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. That is, the ith row contains only i elements.
Kitaev, Sergey; Liese, Jeffrey (2013),
"Harmonic numbers, Catalan's triangle and mesh patterns" (PDF),
Discrete Mathematics,
313 (14):
1515–1531,
arXiv:
1209.6423,
doi:
10.1016/j.disc.2013.03.017,
MR 3047390,
S2CID 18248485.
↑ Hosoya, Haruo (1976), "Fibonacci triangle", The Fibonacci Quarterly, 14 (2): 173–178, doi:10.1080/00150517.1976.12430575.
↑ Edwards, A. W. F. (2002), Pascal's Arithmetical Triangle: The Story of a Mathematical Idea, JHU Press, ISBN 978-0-8018-6946-4.
↑ Barry, Paul (2006), "On integer-sequence-based constructions of generalized Pascal triangles" (PDF), Journal of Integer Sequences, 9 (2) 6.2.4, Bibcode:2006JIntS...9...24B.
↑ Millar, Jessica; Sloane, N. J. A.; Young, Neal E. (1996), "A new operation on sequences: the Boustrouphedon transform", Journal of Combinatorial Theory, Series A, 76 (1): 44–54, arXiv:math.CO/0205218, doi:10.1006/jcta.1996.0087, S2CID 15637402.
The triangular array whose right-hand diagonal sequence consists of Bell numbers