Ordinary Generating Functions

Ordinary Generating Functions is a type of formal power series in which the sequence of coefficients corresponds directly to a sequence of combinatorial counts, distinguished from other generating functions by encoding the sequence $\{a_n\}$ as $\sum_{n=0}^{\infty} a_n x^n$ without additional weighting factors such as factorial denominators or exponential terms.

27

Publications

654

Citations

43

Authors

23

Institutions

Publications per year

2017–2026

6

Variants

OgfOrdinary Generating Function

Authors

43

  1. PC
    Paula Catarino

    University of Trás-os-Montes and Alto Douro, Portugal

    5 publications · 173 citations

    5

    h-index

  2. PV
    Paulo Vasco

    University of Trás-os-Montes and Alto Douro, Portugal

    3 publications · 69 citations

    3

    h-index

  3. GD
    G. Dattoli

    National Agency for New Technologies, Energy and Sustainable Economic Development, Italy

    2 publications · 48 citations

    2

    h-index

  4. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 56 citations

    2

    h-index

  5. RS
    Robert Sedgewick

    Brown University, United States

    2 publications · 56 citations

    2

    h-index

1–5 of 43

Venues

  1. Applied Mathematical Sciences

    2 publications · 53 citations

    2

    h-index

  2. ArXiv.org

    Repository · 2 publications · 86 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 34 citations

    2

    h-index

  4. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 1 publications · 27 citations

    1

    h-index

  5. 1

    h-index

1–5