/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilCentral factorial numbers: $((2n)!!)^2$
Central factorial numbers: $a(n) = 4^n (n!)^2 = ((2n)!!)^2$.
References:
@[expose] public sectionnamespace OeisA2454Central factorial numbers: $a(n) = 4^n (n!)^2$.
def a (n : ℕ) : ℕ :=
4 ^ n * n.factorial ^ 2
Value of the sequence a at 0.
@[category test, AMS 11]
theorem a_0 : a 0 = 1 := ⊢ a 0 = 1 All goals completed! 🐙
Value of the sequence a at 1.
@[category test, AMS 11]
theorem a_1 : a 1 = 4 := ⊢ a 1 = 4 All goals completed! 🐙
Value of the sequence a at 2.
@[category test, AMS 11]
theorem a_2 : a 2 = 64 := ⊢ a 2 = 64 All goals completed! 🐙
Value of the sequence a at 3.
@[category test, AMS 11]
theorem a_3 : a 3 = 2304 := ⊢ a 3 = 2304 All goals completed! 🐙
Value of the sequence a at 4.
@[category test, AMS 11]
theorem a_4 : a 4 = 147456 := ⊢ a 4 = 147456 All goals completed! 🐙Let $\zeta$ be a primitive $(2n+1)$-th root of unity. Then the permanent of the $2n \times 2n$ matrix $[m(j,k)]_{j,k=1..2n}$ is $a(n)/(2n+1) = ((2n)!!)^2/(2n+1)$, where $m(j,k)$ is $1$ or $(1+\zeta^{j-k})/(1-\zeta^{j-k})$ according as $j = k$ or not.
Zhi-Wei Sun, Jun 26 2022
Proved by [SSX22], Theorem 1.3(ii): for odd $m > 1$ and $\zeta$ a primitive $m$-th root of unity, the permanent of $[c_{j,k}]_{1 \le j,k \le m-1}$ is $((m-1)!!)^2/m$. Take $m = 2n+1$; translating both matrix indices by one leaves $j - k$ unchanged. For $n = 0$ the matrix is empty and both sides are $1$.
@[category research solved, AMS 11 15]
theorem conjecture (n : ℕ) :
let N : ℕ := 2 * n
let K : ℕ := N + 1
∀ (ζ : ℂ), IsPrimitiveRoot ζ K →
Matrix.permanent (fun (j k : Fin N) =>
if j = k then
(1 : ℂ)
else
let pow : ℤ := (j : ℤ) - (k : ℤ)
(1 + ζ ^ pow) / (1 - ζ ^ pow)
) = (a n : ℂ) / (K : ℂ) := n:ℕ⊢ let N := 2 * n;
let K := N + 1;
∀ (ζ : ℂ),
IsPrimitiveRoot ζ K →
(Matrix.permanent fun j k ↦
if j = k then 1
else
let pow := ↑↑j - ↑↑k;
(1 + ζ ^ pow) / (1 - ζ ^ pow)) =
↑(OeisA2454.a n) / ↑K
All goals completed! 🐙end OeisA2454