Math 2.0

concept

Catalan numbers

Summary

The Catalan numbers CnC_n form a sequence that counts many recursive structures, such as Dyck words, binary trees and bracketings. They satisfy a convolution recurrence and the formula Cn=(2nn)/(n+1)C_n = \binom{2n}{n}/(n+1). The node Catalan numbers gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Catalan_number, lead section

What links here

Definitions