Bernoulli's triangle
Bernoulli's triangle is an array of partial sums of the binomial coefficients. For any non-negative integer n and for any integer k included between 0 and n, the component in row n and column k is giv
Lah number
In mathematics, the Lah numbers, discovered by Ivo Lah in 1954, are coefficients expressing rising factorials in terms of falling factorials. They are also the coefficients of the th derivatives of .
Eulerian number
In combinatorics, the Eulerian number A(n, m) is the number of permutations of the numbers 1 to n in which exactly m elements are greater than the previous element (permutations with m "ascents"). The
Dudley triangle
In mathematics, the Dudley triangle is a triangular array of integers that was defined by Underwood Dudley. It consists of the numbers (sequence in the OEIS). Dudley exhibited several rows of this tri
Leibniz harmonic triangle
The Leibniz harmonic triangle is a triangular arrangement of unit fractions in which the outermost diagonals consist of the reciprocals of the row numbers and each inner cell is the cell diagonally ab
Gilbreath's conjecture
Gilbreath's conjecture is a conjecture in number theory regarding the sequences generated by applying the forward difference operator to consecutive prime numbers and leaving the results unsigned, and
Singmaster's conjecture
Singmaster's conjecture is a conjecture in combinatorial number theory, named after the British mathematician David Singmaster who proposed it in 1971. It says that there is a finite upper bound on th
Bell triangle
In mathematics, the Bell triangle is a triangle of numbers analogous to Pascal's triangle, whose values count partitions of a set in which a given element is the largest singleton. It is named for its
Hosoya's triangle
Hosoya's triangle or the Hosoya triangle (originally Fibonacci triangle; OEIS: ) is a triangular arrangement of numbers (like Pascal's triangle) based on the Fibonacci numbers. Each number is the sum
Stirling numbers of the second kind
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets and is
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. That is, the ith row conta
Binomial coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0 and
Wythoff array
In mathematics, the Wythoff array is an infinite matrix of integers derived from the Fibonacci sequence and named after Dutch mathematician Willem Abraham Wythoff. Every positive integer occurs exactl
Pascal's simplex
In mathematics, Pascal's simplex is a generalisation of Pascal's triangle into arbitrary number of dimensions, based on the multinomial theorem.
Fibonomial coefficient
In mathematics, the Fibonomial coefficients or Fibonacci-binomial coefficients are defined as where n and k are non-negative integers, 0 ≤ k ≤ n, Fj is the j-th Fibonacci number and n!F is the nth Fib
Narayana number
In combinatorics, the Narayana numbers form a triangular array of natural numbers, called the Narayana triangle, that occur in various counting problems. They are named after Canadian mathematician T.
Pascal's triangle
In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises in probability theory, combinatorics, and algebra. In much of the Western world, it is named after the
Boustrophedon transform
In mathematics, the boustrophedon transform is a procedure which maps one sequence to another. The transformed sequence is computed by an "addition" operation, implemented as if filling a triangular a
Stirling numbers of the first kind
In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations. In particular, the Stirling numbers of the first kind count permutations according t
Triangle of partition numbers
In the number theory of integer partitions, the numbers denote both the number of partitions of into exactly parts (that is, sums of positive integers that add to ), and the number of partitions of in
Catalan's triangle
In combinatorial mathematics, Catalan's triangle is a number triangle whose entries give the number of strings consisting of n X's and k Y's such that no initial segment of the string has more Y's tha
Floyd's triangle
Floyd's triangle is a triangular array of natural numbers, used in computer science education. It is named after Robert Floyd. It is defined by filling the rows of the triangle with consecutive number
Trinomial triangle
The trinomial triangle is a variation of Pascal's triangle. The difference between the two is that an entry in the trinomial triangle is the sum of the three (rather than the two in Pascal's triangle)
Lozanić's triangle
Lozanić's triangle (sometimes called Losanitsch's triangle) is a triangular array of binomial coefficients in a manner very similar to that of Pascal's triangle. It is named after the Serbian chemist
Rencontres numbers
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fixed points: in other words, par
Delannoy number
In mathematics, a Delannoy number describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (m, n), using only single steps north, northeast, or east
Pascal matrix
In mathematics, particularly matrix theory and combinatorics, a Pascal matrix is a (possibly infinite) matrix containing the binomial coefficients as its elements. It is thus an encoding of Pascal's t
Pascal's pyramid
In mathematics, Pascal's pyramid is a three-dimensional arrangement of the trinomial numbers, which are the coefficients of the trinomial expansion and the trinomial distribution. Pascal's pyramid is