Catalan Numbers
Catalan Numbers is a sequence of natural numbers that belongs to the class of integer sequences in enumerative combinatorics, distinguished by its recurrence relation and closed-form formula involving binomial coefficients, commonly used to count a variety of recursively defined combinatorial structures such as balanced parentheses, full binary trees, and non-crossing partitions.
281
Publications
8.9K
Citations
349
Authors
218
Institutions
Publications per year
2017–2026
60
Variants
Catalan Number Sequence
281
Generating trees and the Catalan and Schröder numbers
Julian West · Discrete Mathematics · 1995 · 254 citations
Pascal triangles, Catalan numbers and renewal arrays
Douglas G. Rogers · Discrete Mathematics · 1978 · 157 citations
1–5 of 281
349
16
h-index
8
h-index
7
h-index
7
h-index
7
h-index
1–5 of 349
218
Henan Polytechnic University
Jiaozuo, China
14 h-index
23 publications
587 citations
Tiangong University
Tianjin, China
14 h-index
30 publications
762 citations
Inner Mongolia University for Nationalities
Tongliao, China
12 h-index
15 publications
373 citations
Nanjing University
Nanjing, China
7 h-index
10 publications
322 citations
Dalian University of Technology
Dalian, China
6 h-index
10 publications
223 citations

Univerzitet u Novom Pazaru
Novi Pazar, Serbia
6 h-index
12 publications
264 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
6 publications
713 citations
University of Miami
Coral Gables, United States
5 h-index
5 publications
162 citations
1–8 of 218
20 publications · 1.3K citations
17
h-index
20 publications · 492 citations
14
h-index
Repository · 20 publications · 378 citations
12
h-index
11 publications · 346 citations
11
h-index
Repository · 11 publications · 194 citations
10
h-index
1–5