Catalan's triangle
id:
catalan-s-triangle-287-13033699
title:
Catalan's triangle
text:
In combinatorial mathematics, Catalan's triangle is a number triangle whose entries C 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 than X's. It is a generalization of the Catalan numbers, and is named after Eugène Charles Catalan. Bailey shows that C satisfy the following properties: C = 1 for n ≥ 0 . C = n for n ≥ 1 . C = C + C for 1 < k < n + 1 C = C for n ≥ 1 . Formula 3 shows that the entry in the triangle is obtaine
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Catalan%27s_triangle
date created:
date modified:
2023-11-03T08:56:00Z
main entity:
{"identifier":"Q5051208","url":"https://www.wikidata.org/entity/Q5051208"}
image:
fields total:
13
integrity:
13