Professional Documents
Culture Documents
Pascal's Triangle
Pascal's Triangle
(2)
(OEIS A007318). Pascal's formula shows that each subsequent row is obtained by
adding the two entries diagonally above,
(3)
The plot above shows the binary representations for the first 255 (top figure) and 511
(bottom figure) terms of a flattened Pascal's triangle.
The first number after the 1 in each row divides all other numbers in that row iff it is
a prime.
The sums of the number of odd entries in the first rows of Pascal's triangle
for , 1, ... are 0, 1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, ...
(OEIS A006046). It is then true that
(4)
(Harborth 1976, Le Lionnais 1983), with equality for a power of 2, and the power
(5)
(OEIS A020857). The sequence of cumulative counts of odd entries has some amazing
properties, and the minimum possible value (OEIS A077464) is known
as the Stolarsky-Harborth constant.
Pascal's triangle contains the figurate numbers along its diagonals, as can be seen from
the identity
(6)
(7)
(8)
so the sum of the first rows (i.e., rows 0 to ) is the Mersenne number