Fine numbers
DefinitionFine numbers#✓fully proved
MetaMathlibExt.fineNumber
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
Sources
- Fine numbers (OEIS A000957), zero-based:
fineNumber nis source𝔽_(n+1). Source explicit formula𝔽_n = (1/n) * ∑_{i=1}^n (-2)^(i-1) * i * C(2n, n-i)with𝔽_1 = 1, from JIS VOL21/Janjic3/janjic96.tex lines 105-108 and 157-158. https://cs.uwaterloo.ca/journals/JIS/VOL21/Janjic3/janjic96.tex.
Used by 9
Used byExplicit formula for the Fine numbers · Fine numbers as an alternating binomial sum · Fine numbers from Sabar's triangle · Central entries of Sabar's triangle and Fine numbers · Fine numbers from Whitt's generalized Catalan numbers · Peakless-tieless parking functions with first entry below the last · Valleyless-tieless parking functions are counted by the Fine numbers · Counting ascending \(1\)-Naples parking functions · Ascending \(1\)-Naples parking functions starting with \(1\) and Fine numbers
TheoremExplicit formula for the Fine numbers#✓fully proved
MetaMathlibExt.fineNumber_eq_sum
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) : ℕ) : ℚ)
public def fineNumber (n : Nat) : ℚ :=
(1 / ((n : ℚ) + 1)) * ∑ i ∈ Finset.range (n + 1),
(-2 : ℚ) ^ i * ((i : ℚ) + 1) * ((Nat.choose (2 * (n + 1)) (n - i) : ℕ) : ℚ)
MathlibExt/Combinatorics/FineNumber.lean:25
Uses 1
Statement usesFine numbers
2 fully proved
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.