/-
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 FormalConjecturesUtilA binomial coefficient sum
A binomial coefficient sum: $$a(n) = \sum_{k=0}^{\lfloor n/2 \rfloor} \left( \binom{n}{k} - \binom{n}{k-1} \right)^3$$ where $\binom{n}{-1} = 0$.
References:
[Li26] Wentao Li, A supercongruence for A003161, 2026.
@[expose] public sectionnamespace OeisA3161A binomial coefficient sum: $a(n) = \sum_{k=0}^{\lfloor n/2 \rfloor} (\binom{n}{k} - \binom{n}{k-1})^3$.
def a (n : ℕ) : ℕ :=
∑ k ∈ Finset.range (n / 2 + 1),
let diff : ℤ := (n.choose k : ℤ) - (if k = 0 then 0 else (n.choose (k - 1) : ℤ))
(diff ^ 3).toNat
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 = 1 := ⊢ a 1 = 1 All goals completed! 🐙
Value of the sequence a at 2.
@[category test, AMS 11]
theorem a_2 : a 2 = 2 := ⊢ a 2 = 2 All goals completed! 🐙
Value of the sequence a at 3.
@[category test, AMS 11]
theorem a_3 : a 3 = 9 := ⊢ a 3 = 9 All goals completed! 🐙
Value of the sequence a at 4.
@[category test, AMS 11]
theorem a_4 : a 4 = 36 := ⊢ a 4 = 36 All goals completed! 🐙Auxiliary sequence $b(n) = a(2n-1)$.
def b (n : ℕ) : ℕ :=
a (2 * n - 1)"Conjecture: Let $b(n) = a(2n-1)$. Then the supercongruence $b(np^k) \equiv b(np^{k-1}) \pmod{p^{3k}}$ holds for positive integers $n$ and $k$ and all primes $p \ge 5$."
Peter Bala, Mar 20 2023.
Lean formalization by Wentao Li, with AI assistance; see [Li26].
@[category research solved, AMS 11,
formal_proof using lean4 at "https://github.com/VictorLiwentao/lean-oeis-proofs/blob/41f7b2ba762827a74f1651e76a2ad6d77be6a021/LeanOeisProofs/NewFormalization/A003161.lean#L1717"]
theorem conjecture (n k p : ℕ) (hn : 0 < n) (hk : 0 < k) (hp : p.Prime) (hp_ge : 5 ≤ p) :
(b (n * p ^ k) : ℤ) ≡ (b (n * p ^ (k - 1)) : ℤ) [ZMOD (p : ℤ) ^ (3 * k)] := n:ℕk:ℕp:ℕhn:0 < nhk:0 < khp:Nat.Prime php_ge:5 ≤ p⊢ ↑(b (n * p ^ k)) ≡ ↑(b (n * p ^ (k - 1))) [ZMOD ↑p ^ (3 * k)]
All goals completed! 🐙end OeisA3161