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

Authors

349

  1. FQ
    Feng Qi

    Henan Polytechnic University, China

    22 publications · 593 citations

    16

    h-index

  2. ZS
    Zhi‐Wei Sun

    Nanjing University, China

    8 publications · 253 citations

    8

    h-index

  3. MS
    Muzafer Saračević

    Univerzitet u Novom Pazaru, Serbia

    7 publications · 191 citations

    7

    h-index

  4. BG
    Bai‐Ni Guo

    Henan Polytechnic University, China

    7 publications · 178 citations

    7

    h-index

  5. XS
    Xiao-Ting Shi

    Tiangong University, China

    7 publications · 240 citations

    7

    h-index

1–5 of 349

Venues

  1. Discrete Mathematics

    20 publications · 1.3K citations

    17

    h-index

  2. The Electronic Journal of Combinatorics

    20 publications · 492 citations

    14

    h-index

  3. arXiv (Cornell University)

    Repository · 20 publications · 378 citations

    12

    h-index

  4. Journal of Combinatorial Theory Series A

    11 publications · 346 citations

    11

    h-index

  5. ArXiv.org

    Repository · 11 publications · 194 citations

    10

    h-index

1–5