Fine numbers

DefinitionFine numbers#✓fully proved

For a natural number \(n\), the Fine number \(F(n)\), indexed from \(0\) so that \(F(0) = 1\), is the rational number

\[F(n) = \frac{1}{n+1} \sum_{i=0}^{n} (-2)^i \, (i+1) \binom{2(n+1)}{n-i}.\]
public def fineNumber (n : Nat) : ℚ :=
  (1 / ((n : ℚ) + 1)) * ∑ i ∈ Finset.range (n + 1),
    (-2 : ℚ) ^ i * ((i : ℚ) + 1) * ((Nat.choose (2 * (n + 1)) (n - i) : ℕ) : ℚ)
Sources
Used by 9

TheoremExplicit formula for the Fine numbers#✓fully proved

For every natural number \(n\), the Fine number \(F(n)\), indexed from \(0\) so that \(F(0) = 1\), satisfies

\[F(n) = \frac{1}{n+1} \sum_{i=0}^{n} (-2)^i \, (i+1) \binom{2(n+1)}{n-i}.\]

The source indexes from \(1\): writing \(\mathbb{F}_m = F(m - 1)\) for \(m \ge 1\), it states \(\mathbb{F}_m = \frac{1}{m} \sum_{i=1}^{m} (-2)^{i-1} \, i \binom{2m}{m-i}\), which becomes the formula above on setting \(m = n + 1\) and shifting the summation index down by one.

public theorem fineNumber_eq_sum (n : Nat) :
    fineNumber n = (1 / ((n : ℚ) + 1)) * ∑ i ∈ Finset.range (n + 1),
      (-2 : ℚ) ^ i * ((i : ℚ) + 1) * ((Nat.choose (2 * (n + 1)) (n - i) : ℕ) : ℚ)
Uses 1
Statement usesFine numbers
2 fully proved

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.