Documentation

Mathlib.Combinatorics.Enumerative.Schroder

Schröder numbers #

The Schröder numbers (https://oeis.org/A006318) are a sequence of integers that appear in various combinatorial contexts.

Main definitions #

Main results #

Tags #

Schroeder, Schroder

@[irreducible]

The recursive definition of the sequence of the large Schröder numbers : a (n + 1) = a n + ∑ i : Fin n.succ, a i * a (n - i)

Equations
Instances For
    @[irreducible]

    The small Schröder number is equal to : largeSchroder n = 2 * smallSchroder (n + 1), n ≥ 1

    Equations
    Instances For
      theorem Nat.smallSchroder_succ {n : } (hn : 1 < n) :
      (n + 1).smallSchroder = 3 * n.smallSchroder + 2 * iFinset.Ioo 0 (n - 1), (i + 1).smallSchroder * (n - i).smallSchroder